STOC 2002
An exponential separation between regular and general resolution
Abstract
Two distinct proofs of an exponential separation between regular resolution and unrestricted resolution are given. The previous best known separation between these systems was quasi-polynomial.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM Symposium on Theory of Computing
- Archive span
- 1969-2025
- Indexed papers
- 4364
- Paper id
- 612055766899844019