Boolean programs and quantified propositional proof systems (1999) [8 citations — 0 self]
Download:
|
|
by Stephen Cook, Michael Soltys
Bulletin of the Section of Logic
http://www.cas.mcmaster.ca/~soltys/papers/cook_soltys_boolprg.ps
Add To MetaCart
Abstract:
We introduce the notion of Boolean programs, which provide more concise descriptions of Boolean functions than Boolean circuits. We characterize nonuniform PSPACE in terms of polynomial size families of Boolean programs. We then show how to use Boolean programs to witness quantiers in the subsystems
Citations
| 146 | Bounded arithmetic, propositional logic, and complexity theory – Kraj'icek - 1995 |
| 88 | The complexity of propositional proofs – Urquhart - 1995 |
| 62 | The relative eciency of propositional proof systems – Cook, Reckhow - 1979 |
