Dragonfall
- 1,023
- 5
Every language in co-NP can be reduced in polynomial-time to an instance of \forall x P(x) for some Boolean formula with a single bound variable and no free variables, right?