The following pages link to On small generators (Q802309):
Displaying 8 items.
- Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (Q809600) (← links)
- On some natural complete operators (Q1064780) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- On characterizations of the class PSPACE/poly (Q1107320) (← links)
- Graph isomorphism is in the low hierarchy (Q1116696) (← links)
- Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170) (← links)
- Logarithmic advice classes (Q1193903) (← links)
- Probabilistic complexity classes and lowness (Q1263979) (← links)
