The following pages link to (Q3779736):
Displaying 13 items.
- On the acceptance power of regular languages (Q672323) (← links)
- On the limiting proportion of types (Q677885) (← links)
- Probabilistic polynomial time is closed under parity reductions (Q751270) (← links)
- On the complexity of counting in the polynomial hierarchy (Q808260) (← links)
- The chain method to separate counting classes (Q1384716) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy (Q3990656) (← links)
- Simultaneous strong separations of probabilistic and unambiguous complexity classes (Q3992020) (← links)
- On the power of parity polynomial time (Q5096157) (← links)
- Locally definable acceptance types for polynomial time machines (Q5096782) (← links)
- On the power of parity polynomial time (Q5750401) (← links)
