Jordanian Union Catalogue

Search Libraries Catalogue

Search

Options

Refine

Start Over

Show details

Duplicate Items

Add to My List

Print

Sorts and Limits

Sorts:

Title: Mathematical Foundations of Computer Science 2012 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings / edited by Branislav Rovan, Vladimiro Sassone, Peter Widmayer.
Lecture Notes in Computer Science,
Lecture notes in computer science,
Main Entry: Rovan, Branislav. editor.
Sassone, Vladimiro. editor.
Widmayer, Peter. editor.
SpringerLink (Online service)
Publisher: Springer Berlin Heidelberg : Imprint: Springer,
Publication Date: 2012.
Publication Place: Berlin, Heidelberg :
ISBN: 9783642325892
Subject: Computer science.
Data structures (Computer Science).
Computer software.
Electronic data processing.
Computational complexity.
Computer science.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Numeric Computing.
Data structures.
Mathematical Logic and Formal Languages.
Math Applications in Computer Science.
Series: Lecture Notes in Computer Science, 7464
Lecture notes in computer science, 7464
Contents: 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.

Related Records: Springer eBooks
Printed edition: 9783642325885

Cover Image:

http://images.amazon.com/images/P/9783642325892.jpg

	Agency:	Collection:	Item Type:	Status:	Barcode:	Media Type:
	JUST Main Library	Electronic Resources	No Circulation	Available Online	-636837	Book