The following pages link to (Q3677732):
Displaying 5 items.
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas (Q1262855) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Spectra and satisfiability for logics with successor and a unary function (Q5109229) (← links)