The following pages link to (Q4142695):
Displaying 12 items.
- Interactive proof systems and alternating time-space complexity (Q685437) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- Cyclic automata (Q1100919) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- On uniform circuit complexity (Q1152951) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- P-hardness of the emptiness problem for visibly pushdown languages (Q1944895) (← links)
- Subclasses of \textsc{Ptime} interpreted by programming languages (Q6109064) (← links)
