Mathematical Foundations of Computer Science 2010
by Hlineny, Petr; Kucera, AntoninEdition: 1st
Format: Paperback
Pub. Date: 2010-09-06
Publisher(s): Springer-Verlag New York Inc
Other versions by this Author
List Price: $159.00
Rent Textbook
Select for Price
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
Summary
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R & D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available.
Table of Contents
| New Developments in Quantum Algorithms (Invited Talk) | p. 1 |
| Persistent Homology under Non-uniform Error (Invited Talk) | p. 12 |
| Information Complexity of Online Problems (Invited Talk) | p. 24 |
| Algorithmic Lower Bounds for Problems on Decomposable Graphs (Abstract of Invited Talk) | p. 37 |
| Do We Really Understand the Crossing Numbers? (Invited Talk) | p. 38 |
| Balanced Queries: Divide and Conquer | p. 42 |
| Slowly Synchronizing Automata and Digraphs | p. 55 |
| Weights of Exact Threshold Functions | p. 66 |
| Proof Systems and Transformation Games | p. 78 |
| Scheduling Real-Time Mixed-Criticality Jobs | p. 90 |
| A DEXPTIME-Complete Dolev-Yao Theory with Distributive Encryption | p. 102 |
| On Problem Kernels for Possible Winner Determination under the k-Approval Protocol | p. 114 |
| Counting Minimum (s, t)-Cuts in Weighted Planar Graphs in Polynomial Time | p. 126 |
| Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree | p. 138 |
| Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems | p. 150 |
| Distance Constraint Satisfaction Problems | p. 162 |
| Faster Algorithms on Branch and Clique Decompositions | p. 174 |
| Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks | p. 186 |
| Robust Computations with Dynamical Systems | p. 198 |
| On Factor University in Symbolic Spaces | p. 209 |
| Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity | p. 221 |
| Resource Combinatory Algebras | p. 233 |
| Randomness for Free | p. 246 |
| Qualitative Analysis of Partially-Observable Markov Decision Processes | p. 258 |
| All Symmetric Predicates in NSPACE (n2) Are Stably Computable by the Mediated Population Protocol Model | p. 270 |
| Online Clustering with Variable Sized Clusters | p. 282 |
| Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains | p. 294 |
| Counting Classes and the Fine Structure between NC1 and L | p. 306 |
| The Average Complexity of Moore's State Minimization Algorithm Is O (n log log n) | p. 318 |
| Connected Searching of Weighted Trees | p. 330 |
| Iterated Regret Minimization in Game Graphs | p. 342 |
| Properties of Visibly Pushdown Transducers | p. 355 |
| Second-Order Algebraic Theories (Extended Abstract) | p. 368 |
| Frame Definability for Classes of Trees in the ¿-calculus | p. 381 |
| Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model | p. 393 |
| Finding and Counting Vertex-Colored Subtrees | p. 405 |
| Limiting Negations in Bounded Treewidth and Upward Planar Circuits | p. 417 |
| On the Topological Complexity of MSO+U and Related Automata Models | p. 429 |
| Least and Greatest Solutions of Equations over Sets of Integers | p. 441 |
| Improved Simulation of Nondeterministic Turing Machines | p. 453 |
| The Prize-Collecting Edge Dominating Set Problem in Trees | p. 465 |
| The Multivariate Resultant Is NP-hard in Any Characteristic | p. 477 |
| Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems | p. 489 |
| Meta-Envy-Free Cake-Cutting Protocols | p. 501 |
| Two Variables and Two Successors | p. 513 |
| Harnessing MLF with the Power of System F | p. 525 |
| Describing Average- and Longtime-Behavior by Weighted MSO Logics | p. 537 |
| Solving MINONES-2-SAT as Fast as VERTEX COVER | p. 549 |
| Unambiguous Finite Automata over a Unary Alphabet | p. 556 |
| The Complexity of Finding Reset Words in Finite Automata | p. 568 |
| Does Treewidth Help in Modal Satisfiability? (Extended Abstract) | p. 580 |
| Asynchronous Omega-Regular Games with Partial Information | p. 592 |
| Parity Games with Partial Information Played on Graphs of Bounded Complexity | p. 604 |
| Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets | p. 616 |
| Enumeration of the Monomials of a Polynomial and Related Complexity Classes | p. 629 |
| Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs | p. 641 |
| Semi-linear Parikh Images of Regular Expressions via Reduction | p. 653 |
| Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds | p. 665 |
| Mesh Deformation of Dynamic Smooth Manifolds with Surface Correspondences | p. 677 |
| Counting Dependent and Independent Strings | p. 689 |
| Impossibility of Independence Amplification in Kolmogorov Complexity Theory | p. 701 |
| Author Index | p. 713 |
| Table of Contents provided by Ingram. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.