|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-642-13562-0 |
| 003 |
DE-He213 |
| 005 |
20230221174828.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100531s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642135620
|9 978-3-642-13562-0
|
| 024 |
7 |
|
|a 10.1007/978-3-642-13562-0
|2 doi
|
| 050 |
|
4 |
|a QA76.6-76.66
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a UM
|2 thema
|
| 082 |
0 |
4 |
|a 005.11
|2 23
|
| 245 |
1 |
0 |
|a Theory and Applications of Models of Computation
|h [electronic resource] :
|b 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings /
|c edited by Jan Kratochvil, Angsheng Li, Jiri Fiala, Petr Kolman.
|
| 250 |
|
|
|a 1st ed. 2010.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
| 300 |
|
|
|a XIV, 480 p. 91 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6108
|
| 505 |
0 |
|
|a Plenary Talks -- New Research Directions in the Information Age -- The Laplacian Paradigm: Emerging Algorithms for Massive Graphs -- Special Sessions -- Proof Complexity of Non-classical Logics -- Optimal Acceptors and Optimal Proof Systems -- The Complexity of Geometric Problems in High Dimension -- Different Approaches to Proof Systems -- Algebraic Proofs over Noncommutative Formulas -- Contributed Papers -- Nonlocal Quantum XOR Games for Large Number of Players -- Nontriviality for Exponential Time w.r.t. Weak Reducibilities -- Streaming Algorithms for Some Problems in Log-Space -- Temperature Aware Online Scheduling with a Low Cooling Factor -- On Solution Concepts for Matching Games -- Binary De Bruijn Partial Words with One Hole -- Complexity Invariance of Real Interpretations -- Pivot and Loop Complementation on Graphs and Set Systems -- Revisiting the Minimum Breakpoint Linearization Problem -- An -time Algorithm for the Minimal Interval Completion Problem -- Centdian Computation for Sensor Networks -- Twisted Jacobi Intersections Curves -- L(2,1,1)-Labeling Is NP-Complete for Trees -- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs -- The Max k-Cut Game and Its Strong Equilibria -- Kernel and Fast Algorithm for Dense Triplet Inconsistency -- Incremental List Coloring of Graphs, Parameterized by Conservation -- Schnyder Greedy Routing Algorithm -- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width -- A Note on the Testability of Ramsey's Class -- Deterministic Polynomial-Time Algorithms for Designing Short DNA Words -- Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult -- A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions -- Graph Sharing Games: Complexity and Connectivity -- A Visual Model of Computation -- An Automata-Theoretic Characterization of the Chomsky-Hierarchy -- Maximum Independent Set in Graphs of Average Degree at Most Three in -- Simultaneity in Event Structures -- Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable -- Closed Rectangle-of-Influence Drawings for Irreducible Triangulations -- Recovering Social Networks from Contagion Information -- Two-Layer Planarization Parameterized by Feedback Edge Set -- A Categorical View of Timed Weak Bisimulation -- Community Structure in Large Complex Networks -- Generating Internally Triconnected Rooted Plane Graphs.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Compilers (Computer programs).
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
1 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Compilers and Interpreters.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 700 |
1 |
|
|a Kratochvil, Jan.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Li, Angsheng.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Fiala, Jiri.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Kolman, Petr.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642135613
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642135637
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6108
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-13562-0
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
