The following pages link to (Q4131648):
Displaying 50 items.
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← 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)
- Super-Solutions (Q2946725) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- Reasoning About Substructures and Games (Q2957764) (← 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)
- Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)
- (Q3304106) (← 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)
- Nominal Kleene Coalgebra (Q3449483) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- (Q4993272) (← links)
- (Q5005100) (← links)
- (Q5005153) (← links)
- Canonical Models and the Complexity of Modal Team Logic (Q5079755) (← links)
- (Q5089158) (← links)
- (Q5089308) (← links)
- (Q5089314) (← links)
- (Q5090999) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- Deciding equivalence of finite tree automata (Q5096180) (← links)
- Counting problems for parikh images (Q5111226) (← links)
- (Q5111236) (← links)
- Emptiness Problems for Integer Circuits (Q5111247) (← links)
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (Q5170277) (← links)
- Expressive capacity of subregular expressions (Q5223616) (← links)
- Multi-Linear Iterative K-Σ-Semialgebras (Q5739356) (← links)
- Testing containment of object-oriented conjunctive queries is ∏2p-hard (Q6064017) (← links)
- On counting propositional logic and Wagner's hierarchy (Q6100184) (← links)
- Feferman-vaught decompositions for prefix classes of first order logic (Q6117143) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
