000 05054nam a22006255i 4500
001 978-3-642-13562-0
003 DE-He213
005 20240730195856.0
007 cr nn 008mamaa
008 100531s2010 gw | s |||| 0|eng d
020 _a9783642135620
_9978-3-642-13562-0
024 7 _a10.1007/978-3-642-13562-0
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aTheory and Applications of Models of Computation
_h[electronic resource] :
_b7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings /
_cedited by Jan Kratochvil, Angsheng Li, Jiri Fiala, Petr Kolman.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXIV, 480 p. 91 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6108
505 0 _aPlenary 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 VisualModel 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 _aComputer programming.
_94169
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer science.
_99832
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aAlgorithms.
_93390
650 1 4 _aProgramming Techniques.
_9161555
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aTheory of Computation.
_9161556
650 2 4 _aMathematics of Computing.
_931875
650 2 4 _aAlgorithms.
_93390
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
700 1 _aKratochvil, Jan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9161557
700 1 _aLi, Angsheng.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9161558
700 1 _aFiala, Jiri.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9161559
700 1 _aKolman, Petr.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9161560
710 2 _aSpringerLink (Online service)
_9161561
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642135613
776 0 8 _iPrinted edition:
_z9783642135637
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6108
_9161562
856 4 0 _uhttps://doi.org/10.1007/978-3-642-13562-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95810
_d95810