000 06127nam a22006015i 4500
001 978-3-642-15155-2
003 DE-He213
005 20240730194735.0
007 cr nn 008mamaa
008 100814s2010 gw | s |||| 0|eng d
020 _a9783642151552
_9978-3-642-15155-2
024 7 _a10.1007/978-3-642-15155-2
_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 _aMathematical Foundations of Computer Science 2010
_h[electronic resource] :
_b35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings /
_cedited by Petr Hlineny, Antonin Kucera.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXVII, 714 p. 71 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 ;
_v6281
505 0 _aNew Developments in Quantum Algorithms -- Persistent Homology under Non-uniform Error -- Information Complexity of Online Problems -- Algorithmic Lower Bounds for Problems on Decomposable Graphs -- Do We Really Understand the Crossing Numbers? -- Balanced Queries: Divide and Conquer -- Slowly Synchronizing Automata and Digraphs -- Weights of Exact Threshold Functions -- Proof Systems and Transformation Games -- Scheduling Real-Time Mixed-Criticality Jobs -- A dexptime-Complete Dolev-Yao Theory with Distributive Encryption -- On Problem Kernels for Possible Winner Determination under the k-Approval Protocol -- Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time -- Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree -- Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems -- Distance Constraint Satisfaction Problems -- Faster Algorithms on Branch and Clique Decompositions -- Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks -- Robust Computations with Dynamical Systems -- On Factor Universality in Symbolic Spaces -- Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity -- Resource Combinatory Algebras -- Randomness for Free -- Qualitative Analysis of Partially-Observable Markov Decision Processes -- All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model -- Online Clustering with Variable Sized Clusters -- Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains -- Counting Classes and the Fine Structure between NC 1 and L -- The Average Complexity of Moore's State Minimization Algorithm Is O( n loglogn) -- Connected Searching of Weighted Trees -- Iterated Regret Minimization inGame Graphs -- Properties of Visibly Pushdown Transducers -- Second-Order Algebraic Theories -- Frame Definability for Classes of Trees in the ?-calculus -- Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model -- Finding and Counting Vertex-Colored Subtrees -- Limiting Negations in Bounded Treewidth and Upward Planar Circuits -- On the Topological Complexity of MSO+U and Related Automata Models -- Least and Greatest Solutions of Equations over Sets of Integers -- Improved Simulation of Nondeterministic Turing Machines -- The Prize-Collecting Edge Dominating Set Problem in Trees -- The Multivariate Resultant Is NP-hard in Any Characteristic -- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems -- Meta-Envy-Free Cake-Cutting Protocols -- Two Variables and Two Successors -- Harnessing ML F with the Power of System F -- Describing Average- and Longtime-Behavior by Weighted MSO Logics -- Solving minones-2-sat as Fast as vertex cover -- Unambiguous Finite Automata over a Unary Alphabet -- The Complexity of Finding Reset Words in Finite Automata -- Does Treewidth Help in Modal Satisfiability? -- Asynchronous Omega-Regular Games with Partial Information -- Parity Games with Partial Information Played on Graphs of Bounded Complexity -- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets -- Enumeration of the Monomials of a Polynomial and Related Complexity Classes -- Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs -- Semi-linear Parikh Images of Regular Expressions via Reduction -- Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds -- Mesh Deformation of Dynamic Smooth Manifolds with Surface Correspondences -- Counting Dependent and IndependentStrings -- Impossibility of Independence Amplification in Kolmogorov Complexity Theory.
650 0 _aComputer programming.
_94169
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aProgramming Techniques.
_9157889
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aTheory of Computation.
_9157890
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aHlineny, Petr.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9157891
700 1 _aKucera, Antonin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9157892
710 2 _aSpringerLink (Online service)
_9157893
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642151545
776 0 8 _iPrinted edition:
_z9783642151569
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6281
_9157894
856 4 0 _uhttps://doi.org/10.1007/978-3-642-15155-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95309
_d95309