| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465486703316 |
|
|
Titolo |
Mathematical Foundations of Computer Science 2012 [[electronic resource] ] : 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings / / edited by Branislav Rovan, Vladimiro Sassone, Peter Widmayer |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2012.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XV, 825 p. 102 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 7464 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Numerical analysis |
Artificial intelligence—Data processing |
Machine theory |
Discrete Mathematics in Computer Science |
Numerical Analysis |
Data Science |
Formal Languages and Automata Theory |
Mathematical Applications in Computer Science |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
International conference proceedings. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and author index. |
|
|
|
|
|
|
Nota di contenuto |
|
On 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. |
|
|
|
|
|
|
Sommario/riassunto |
|
This 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. |
|
|
|
|
|
|
|
| |