Previous Conferences & Workshops
Dec
10
2000
Workshop on Complexity of Proofs and Computations
Linear Lower Bounds for Space of Refuting Random CNF's
3:30pm|Simonyi Hall 101
Dec
10
2000
Workshop on Complexity of Proofs and Computations
Resolution is not automatizable unless MMSA can be efficiently approximated for small weights
2:30pm|Simonyi Hall 101
Dec
10
2000
Workshop on Complexity of Proofs and Computations
"Planar" Tautologies Hard for Resolution
Stefan Dantchev
11:30am|Simonyi Hall 101
Dec
10
2000
Workshop on Complexity of Proofs and Computations
The Weak Pigeonhole
Neil Thapen
10:30am|Simonyi Hall 101
Dec
10
2000
Workshop on Complexity of Proofs and Computations
Regular Resolution Lower Bounds for the Weak Pigeonhole Principle
9:30am|Simonyi Hall 101