Rank lower bounds in propositional proof systems based on integer linear programming methods
The work of this thesis is in the area of proof complexity, an area which looks to uncover the limitations of proof systems. In this thesis we investigate the rank complexity of tautologies for several of the most important proof systems based on integer linear programming methods. The three main co...
| Main Author: | |
|---|---|
| Published: |
Durham University
2009
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510605 |