The following pages link to (Q4131648):
Displaying 50 items.
- An improved lower bound for the elementary theories of trees (Q4647523) (← links)
- (Q4989409) (← links)
- Size, cost and capacity: a semantic technique for hard random QBFs (Q4993272) (← links)
- Balance problems for integer circuits (Q5005100) (← links)
- (Q5005153) (← links)
- (Q5015279) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- (Q5018521) (← links)
- THE MODAL LOGIC OF STEPWISE REMOVAL (Q5065135) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- Rational, recognizable, and aperiodic partially lossy queue languages (Q5075703) (← links)
- Canonical Models and the Complexity of Modal Team Logic (Q5079755) (← links)
- THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES (Q5086506) (← links)
- (Q5089158) (← links)
- (Q5089308) (← links)
- (Q5089314) (← links)
- (Q5090999) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- (Q5094125) (← links)
- Deciding equivalence of finite tree automata (Q5096180) (← links)
- The emptiness problem for intersections of regular languages (Q5096847) (← links)
- Beyond NP: Quantifying over Answer Sets (Q5108497) (← links)
- Counting problems for parikh images (Q5111226) (← links)
- (Q5111236) (← links)
- Emptiness Problems for Integer Circuits (Q5111247) (← links)
- A note on the complexity of S4.2 (Q5156186) (← links)
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (Q5170277) (← links)
- Playing Savitch and Cooking Games (Q5187817) (← links)
- On the complexity of dataflow analysis of logic programs (Q5204343) (← links)
- Checking equivalences between concurrent systems of finite agents (Extended abstract) (Q5204358) (← links)
- Reset Complexity of Ideal Languages Over a Binary Alphabet (Q5205048) (← links)
- Expressive capacity of subregular expressions (Q5223616) (← links)
- Satisfiability of Algebraic Circuits over Sets of Natural Numbers (Q5458839) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions (Q5505596) (← links)
- Multi-Linear Iterative K-Σ-Semialgebras (Q5739356) (← links)
- Power indices and easier hard problems (Q5751941) (← links)
- Diophantine equations, Presburger arithmetic and finite automata (Q5878899) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5918382) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5919501) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5919539) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5920059) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5925549) (← links)
- Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765) (← links)
- Integer circuit evaluation is PSPACE-complete (Q5956016) (← links)
- Monitoring first-order interval logic (Q6041276) (← links)
- Fair simulation (Q6044123) (← links)
- Testing containment of object-oriented conjunctive queries is ∏2p-hard (Q6064017) (← links)
- On counting propositional logic and Wagner's hierarchy (Q6100184) (← links)
