LEADER 05396nam 22007935 450 001 996465949003316 005 20230221174828.0 010 $a1-280-38709-2 010 $a9786613565013 010 $a3-642-13562-5 024 7 $a10.1007/978-3-642-13562-0 035 $a(CKB)2550000000011552 035 $a(SSID)ssj0000446829 035 $a(PQKBManifestationID)11269714 035 $a(PQKBTitleCode)TC0000446829 035 $a(PQKBWorkID)10505187 035 $a(PQKB)10522169 035 $a(DE-He213)978-3-642-13562-0 035 $a(MiAaPQ)EBC3065325 035 $a(PPN)149063806 035 $a(EXLCZ)992550000000011552 100 $a20100531d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory and Applications of Models of Computation$b[electronic resource] $e7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings /$fedited by Jan Kratochvil, Angsheng Li, Jiri Fiala, Petr Kolman 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XIV, 480 p. 91 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6108 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-13561-7 320 $aIncludes bibliographical references and index. 327 $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 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6108 606 $aComputer programming 606 $aCompilers (Computer programs) 606 $aComputer science 606 $aComputer science?Mathematics 606 $aAlgorithms 606 $aProgramming Techniques 606 $aCompilers and Interpreters 606 $aTheory of Computation 606 $aMathematics of Computing 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 615 0$aComputer programming. 615 0$aCompilers (Computer programs). 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 0$aAlgorithms. 615 14$aProgramming Techniques. 615 24$aCompilers and Interpreters. 615 24$aTheory of Computation. 615 24$aMathematics of Computing. 615 24$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 676 $a004.0151 702 $aKratochvil$b Jan$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLi$b Angsheng$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFiala$b Jiri$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKolman$b Petr$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aTAMC 2010 906 $aBOOK 912 $a996465949003316 996 $aTheory and Applications of Models of Computation$9772738 997 $aUNISA