The following pages link to (Q4131648):
Displayed 50 items.
- Generalising automaticity to modal properties of finite structures (Q2373714) (← links)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- The complexity of online manipulation of sequential elections (Q2637642) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- Compressing BMC Encodings with QBF (Q2864383) (← links)
- Kleene Monads: Handling Iteration in a Framework of Generic Effects (Q2888474) (← links)
- Turing Machines for Dummies (Q2891358) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Transformations into Normal Forms for Quantified Circuits (Q3007687) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- Complexity results for prefix grammars (Q3025324) (← links)
- A covering system with least modulus 25 (Q3055135) (← links)
- The quantifier complexity of polynomial-size iterated definitions in first-order logic (Q3066290) (← links)
- Validating QBF Validity in HOL4 (Q3088005) (← links)
- Proving Valid Quantified Boolean Formulas in HOL Light (Q3088006) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- On the restricted equivalence for subclasses of propositional logic (Q3142267) (← links)
- Limiting characterizations of low level space complexity classes (Q3142271) (← links)
- Weighted Bisimulation in Linear Algebraic Form (Q3184672) (← links)
- Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
- A note on the complexity of program evaluation (Q3319774) (← links)
- Relativized polynomial hierarchies extending two levels (Q3331211) (← links)
- Series which are both max-plus and min-plus rational are unambiguous (Q3374753) (← links)
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet (Q3392954) (← links)
- Note on the complexity of Las Vegas automata problems (Q3421911) (← links)
- The polynomial hierarchy for some structures over the binary words (Q3423149) (← links)
- Solving Linear Equations in *-continuous Action Lattices (Q3498422) (← links)
- Automatic Proof Generation in Kleene Algebra (Q3498428) (← links)
- Latticed Simulation Relations and Games (Q3510804) (← links)
- Correcting a Space-Efficient Simulation Algorithm (Q3512514) (← links)
- Functions Definable by Arithmetic Circuits (Q3576073) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Antimirov and Mosses’s Rewrite System Revisited (Q3602800) (← links)
- Five Determinisation Algorithms (Q3602811) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Minimal NFA and biRFSA Languages (Q3625690) (← links)
- A Compact Representation for Syntactic Dependencies in QBFs (Q3637175) (← links)
- On Equations over Sets of Numbers and Their Limitations (Q3637239) (← links)
- Dynamic Observers for the Synthesis of Opaque Systems (Q3648711) (← links)
- Synthesis of Non-Interferent Timed Systems (Q3648818) (← links)
- Recognition of properties of autonomous structural automata (Q3893841) (← links)
- Complexity of some problems concerningL systems (Q3896507) (← links)
- Relativization of questions about log space computability (Q4109299) (← links)
- On the complexity of finite, pushdown, and stack automata (Q4121398) (← links)
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages (Q4128015) (← links)
- (Q4146255) (← links)
- The Analytic Polynomial-Time Hierarchy (Q4224087) (← links)
- Playing Savitch and Cooking Games (Q5187817) (← links)
- Satisfiability of Algebraic Circuits over Sets of Natural Numbers (Q5458839) (← links)