The following pages link to (Q3880807):
Displayed 6 items.
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Complexity of Boolean algebras (Q1137036) (← links)
- On time-space classes and their relation to the theory of real addition (Q1155607) (← links)
- The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534) (← links)
- THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES (Q5086506) (← links)