Pages that link to "Item:Q3586065"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2010 (Q3586065):
Displayed 50 items.
- Distance constraint satisfaction problems (Q259047) (← links)
- New Developments in Quantum Algorithms (Q3586066) (← links)
- Persistent Homology under Non-uniform Error (Q3586067) (← links)
- Information Complexity of Online Problems (Q3586068) (← links)
- Do We Really Understand the Crossing Numbers? (Q3586069) (← links)
- Balanced Queries: Divide and Conquer (Q3586071) (← links)
- Slowly Synchronizing Automata and Digraphs (Q3586072) (← links)
- Weights of Exact Threshold Functions (Q3586073) (← links)
- Proof Systems and Transformation Games (Q3586074) (← links)
- Scheduling Real-Time Mixed-Criticality Jobs (Q3586075) (← links)
- A dexptime-Complete Dolev-Yao Theory with Distributive Encryption (Q3586076) (← links)
- On Problem Kernels for Possible Winner Determination under the k-Approval Protocol (Q3586077) (← links)
- Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time (Q3586078) (← links)
- Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree (Q3586079) (← links)
- Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems (Q3586080) (← links)
- Faster Algorithms on Branch and Clique Decompositions (Q3586082) (← links)
- Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks (Q3586083) (← links)
- Robust Computations with Dynamical Systems (Q3586084) (← links)
- On Factor Universality in Symbolic Spaces (Q3586085) (← links)
- Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity (Q3586086) (← links)
- Resource Combinatory Algebras (Q3586087) (← links)
- Randomness for Free (Q3586088) (← links)
- Qualitative Analysis of Partially-Observable Markov Decision Processes (Q3586089) (← links)
- All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model (Q3586090) (← links)
- Online Clustering with Variable Sized Clusters (Q3586091) (← links)
- Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains (Q3586092) (← links)
- Counting Classes and the Fine Structure between NC 1 and L (Q3586093) (← links)
- The Average Complexity of Moore’s State Minimization Algorithm Is O( n loglogn) (Q3586094) (← links)
- Connected Searching of Weighted Trees (Q3586095) (← links)
- Iterated Regret Minimization in Game Graphs (Q3586096) (← links)
- Properties of Visibly Pushdown Transducers (Q3586097) (← links)
- Second-Order Algebraic Theories (Q3586098) (← links)
- Frame Definability for Classes of Trees in the μ-calculus (Q3586099) (← links)
- Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model (Q3586100) (← links)
- Finding and Counting Vertex-Colored Subtrees (Q3586101) (← links)
- Limiting Negations in Bounded Treewidth and Upward Planar Circuits (Q3586102) (← links)
- On the Topological Complexity of MSO+U and Related Automata Models (Q3586103) (← links)
- Least and Greatest Solutions of Equations over Sets of Integers (Q3586104) (← links)
- Improved Simulation of Nondeterministic Turing Machines (Q3586105) (← links)
- The Prize-Collecting Edge Dominating Set Problem in Trees (Q3586106) (← links)
- The Multivariate Resultant Is NP-hard in Any Characteristic (Q3586107) (← links)
- Meta-Envy-Free Cake-Cutting Protocols (Q3586108) (← links)
- Two Variables and Two Successors (Q3586109) (← links)
- Harnessing ML F with the Power of System F (Q3586110) (← links)
- Describing Average- and Longtime-Behavior by Weighted MSO Logics (Q3586111) (← links)
- Solving minones-2-sat as Fast as vertex cover (Q3586112) (← links)
- Unambiguous Finite Automata over a Unary Alphabet (Q3586113) (← links)
- The Complexity of Finding Reset Words in Finite Automata (Q3586114) (← links)
- Asynchronous Omega-Regular Games with Partial Information (Q3586115) (← links)
- Parity Games with Partial Information Played on Graphs of Bounded Complexity (Q3586116) (← links)