1 option
Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings / edited by Petr Hlineny, Antonin Kucera.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 6281.
- Theoretical Computer Science and General Issues ; 6281
- Language:
- English
- Subjects (All):
- Computer programming.
- Programming languages (Electronic computers).
- Computers.
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Programming Techniques.
- Programming Languages, Compilers, Interpreters.
- Theory of Computation.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computation by Abstract Devices.
- Local Subjects:
- Programming Techniques.
- Programming Languages, Compilers, Interpreters.
- Theory of Computation.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computation by Abstract Devices.
- Physical Description:
- 1 online resource (XVII, 714 pages) : 71 illustrations.
- Edition:
- First edition 2010.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
- System Details:
- text file PDF
- Contents:
- New 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 in Game 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 Independent Strings
- Impossibility of Independence Amplification in Kolmogorov Complexity Theory.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-15155-2
- 9783642151552
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.