Pages that link to "Item:Q2946320"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2015 (Q2946320):
Displaying 50 items.
- Polynomial kernels for weighted problems (Q340549) (← links)
- Mutual dimension and random sequences (Q1637218) (← links)
- On the complexity of noncommutative polynomial factorization (Q1784944) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- Minimal and Monotone Minimal Perfect Hash Functions (Q2946321) (← links)
- Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview (Q2946322) (← links)
- Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
- Robust Inference and Local Algorithms (Q2946324) (← links)
- Uniform Generation in Trace Monoids (Q2946325) (← links)
- When Are Prime Formulae Characteristic? (Q2946326) (← links)
- Stochastization of Weighted Automata (Q2946327) (← links)
- Recurrence Function on Sturmian Words: A Probabilistic Study (Q2946329) (← links)
- Exponential-Size Model Property for PDL with Separating Parallel Composition (Q2946330) (← links)
- A Circuit Complexity Approach to Transductions (Q2946331) (← links)
- Locally Chain-Parsable Languages (Q2946332) (← links)
- Classes of Languages Generated by the Kleene Star of a Word (Q2946333) (← links)
- Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus (Q2946334) (← links)
- Weighted Automata and Logics on Graphs (Q2946335) (← links)
- Longest Gapped Repeats and Palindromes (Q2946337) (← links)
- Quasiperiodicity and Non-computability in Tilings (Q2946338) (← links)
- The Transitivity Problem of Turing Machines (Q2946339) (← links)
- Strong Inapproximability of the Shortest Reset Word (Q2946340) (← links)
- Finitary Semantics of Linear Logic and Higher-Order Model-Checking (Q2946341) (← links)
- Complexity of Propositional Independence and Inclusion Logic (Q2946342) (← links)
- Modal Inclusion Logic: Being Lax is Simpler than Being Strict (Q2946343) (← links)
- Differential Bisimulation for a Markovian Process Algebra (Q2946344) (← links)
- On the Hardness of Almost–Sure Termination (Q2946345) (← links)
- Graphs Identified by Logics with Counting (Q2946347) (← links)
- Synchronizing Automata with Extremal Properties (Q2946348) (← links)
- Ratio and Weight Quantiles (Q2946351) (← links)
- Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem (Q2946352) (← links)
- Definability by Weakly Deterministic Regular Expressions with Counters is Decidable (Q2946353) (← links)
- On the Complexity of Reconfiguration in Systems with Legacy Components (Q2946354) (← links)
- Eliminating Recursion from Monadic Datalog Programs on Trees (Q2946356) (← links)
- Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) (Q2946357) (← links)
- Emergence on Decreasing Sandpile Models (Q2946358) (← links)
- Lost in Self-Stabilization (Q2946359) (← links)
- Equations and Coequations for Weighted Automata (Q2946360) (← links)
- Near-Optimal Asymmetric Binary Matrix Partitions (Q2946372) (← links)
- Dual VP Classes (Q2946373) (← links)
- On Tinhofer’s Linear Programming Approach to Isomorphism Testing (Q2946374) (← links)
- An Algebraic Proof of the Real Number PCP Theorem (Q2946376) (← links)
- On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← links)
- On the Complexity of Speed Scaling (Q2946378) (← links)
- Almost All Functions Require Exponential Energy (Q2946379) (← links)
- On Dynamic DFS Tree in Directed Graphs (Q2946380) (← links)
- Metric Dimension of Bounded Width Graphs (Q2946381) (← links)
- Equality, Revisited (Q2946382) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
