Pages that link to "Item:Q793017"
From MaRDI portal
The following pages link to Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017):
Displaying 7 items.
- On the complexity of queries in the logical data model (Q688665) (← links)
- The complexity of almost linear diophantine problems (Q753494) (← links)
- Simple sentences that are hard to decide (Q810009) (← links)
- Computational complexity of logical theories of one successor and another unary function (Q868664) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- The role of rudimentary relations in complexity theory (Q3347299) (← links)
