Propositional proof systems : efficiency and automatizability
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2003. === Includes bibliographical references (p. 135-143). === The thesis considers two fundamental questions in propositional proof complexity: lower bounds on the size of the shortest proof and automatizability of propo...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/29344 |