000 05341nam a22006375i 4500
001 978-3-642-32589-2
003 DE-He213
005 20240730190149.0
007 cr nn 008mamaa
008 120801s2012 gw | s |||| 0|eng d
020 _a9783642325892
_9978-3-642-32589-2
024 7 _a10.1007/978-3-642-32589-2
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aMathematical Foundations of Computer Science 2012
_h[electronic resource] :
_b37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings /
_cedited by Branislav Rovan, Vladimiro Sassone, Peter Widmayer.
250 _a1st ed. 2012.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aXV, 825 p. 102 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 ;
_v7464
505 0 _aOn the Complexity of Ontological Reasoning under Disjunctive -- Existential Rules -- New Races in Parameterized Algorithmics -- Scott Is Always Simple -- Simple Models for Recursive Schemes -- Unordered Constraint Satisfaction Games -- A Polynomial-Time Algorithm for Computing the Maximum Common -- Subgraph of Outerplanar Graphs of Bounded Degree -- Reductions to the Set of Random Strings: The Resource-Bounded Case -- Approximate Graph Isomorphism -- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups -- Generating Functions of Timed Languages -- The Robust Set Problem: Parameterized Complexity and Approximation -- Mortality for 2 × 2 Matrices Is NP-Hard -- Solving Counter Parity Games -- Drawing Planar Graphs on Points Inside a Polygon -- Smoothed Complexity Theory -- Abelian Pattern Avoidance in Partial Words -- The Complexity of Rerouting Shortest Paths -- Computing with Large Populations Using Interactions -- Pancake Flipping Is Hard -- In-place Heap Construction with Optimized Comparisons, Moves, and Cache -- A Dichotomy Theorem for Homomorphism -- On the Impact of Fair Best Response Dynamics -- When Trees Grow Low: Shrubs and Fast MSO1 -- Obtaining Planarity by Contracting Few  Kernels for Edge Dominating Set -- Quasi-recognizable vs MSO Definable Languages of One-Dimensional -- Reversal Hierarchies for Small -- The Lower Reaches of Circuit Weakly-Synchronized Ground Tree Rewriting -- Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs -- Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games -- Maximum Cliques in Graphs with Small Intersection Number and Random Intersection -- Regularity Problems for Weak Pushdown ω-Automata and Games -- Computational Aspects of Cellular Automata on Countable Sofic Shifts -- On Two Stronger Versions of Dejean's Conjecture -- A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments.
520 _aThis volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aMachine theory.
_9141506
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aData Science.
_934092
650 2 4 _aFormal Languages and Automata Theory.
_9141507
650 2 4 _aMathematical Applications in Computer Science.
_931683
700 1 _aRovan, Branislav.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9141508
700 1 _aSassone, Vladimiro.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9141509
700 1 _aWidmayer, Peter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9141510
710 2 _aSpringerLink (Online service)
_9141511
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642325885
776 0 8 _iPrinted edition:
_z9783642325908
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v7464
_9141512
856 4 0 _uhttps://doi.org/10.1007/978-3-642-32589-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93117
_d93117