The following pages link to The polynomial-time hierarchy (Q1236109):
Displaying 7 items.
- The complexity of Boolean formula minimization (Q619911) (← links)
- Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- Does co-NP have short interactive proofs ? (Q1108004) (← links)
- Probabilistic quantifiers and games (Q1112019) (← links)
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis (Q1168733) (← links)
- Intuitionistic propositional logic is polynomial-space complete (Q1259589) (← links)
