Computer Science - Theory and Applications: Lecture Notes in Computer Science, cartea 12159
Editat de Henning Fernauen Limba Engleză Paperback – 13 iun 2020
The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data.
The conference was cancelled as a live conference due to the corona pandemic.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 329.74 lei
Preț vechi: 412.17 lei
-20%
Puncte Express: 495
Carte tipărită la comandă
Livrare economică 02-16 iulie
Specificații
ISBN-13: 9783030500252
ISBN-10: 303050025X
Pagini: 448
Ilustrații: XI, 433 p. 187 illus., 23 illus. in color.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:1st ed. 2020
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 303050025X
Pagini: 448
Ilustrații: XI, 433 p. 187 illus., 23 illus. in color.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:1st ed. 2020
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations.- Parameterized Analysis of Art Gallery and Terrain Guarding.- Central Positions in Social Networks.- Second-Order Finite Automata.- Isomorphic Distances Among Elections.- Tandem Duplications, Segmental Duplications and Deletions, and their Applications.- Faster 2-Disjoint-Shortest-Path Algorithm.- An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter.- The Normalized Algorithmic Information Distance Cannot be Approximated.- Definable Subsets of Polynomial-Time Algebraic Structures.- Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics.- Nested Regular Expressions can be Compiled to Small Deterministic Nested Word Automata.- On Embeddability of Unit Disk Graphs onto Straight Lines.-On the Decision Tree Complexity of Threshold Functions.- Randomized and Symmetric Catalytic Computation.- On the Parameterized Complexity of the Expected Coverage Problem.- Computational Hardness of Multidimensional Subtraction Games.- Parameterized Complexity of Fair Feedback Vertex Set Problem.- The Power of Leibniz-like Functions as Oracles.- Optimal Skeleton Huffman Trees Revisited.- The Subtrace Order and Counting First-Order Logic.- Speedable left-c.e. Numbers.- The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters.- On the Transformation of LL(k)-linear Grammars to LL(1)-linear.- On Computing the Hamiltonian Index of Graphs.- A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels.- Kernelization of Arc Disjoint Cycle Packing in $\alpha$-bounded Digraphs.- On Subquadratic Derivational Complexity of Semi-Thue Systems.- The Untold Story of SBP.- Weighted Rooted Trees: Fat or Tall.- Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals.