![School of Mathematics Event](/sites/default/files/styles/two_column_medium/public/2019-09/sm_default.jpg?itok=gMvWynkh)
Workshop on Complexity of Proofs and Computations
"Planar" Tautologies Hard for Resolution
Date & Time
December 10, 2000 | 11:30am – 12:15pm
Location
Simonyi Hall 101Speakers
Stefan Dantchev
Affiliation
Basic Research in Computer Science
Event Series
Categories
Notes
Workshop site: /math/workshop-cpc