Applications of Games to Propositional Proof Complexity
In this thesis we explore a number of ways in which combinatorial games can be used to help prove results in the area of propositional proof complexity. The results in this thesis can be divided into two sets, the first being dedicated to the study of Resolution space (memory) requirements, wherea...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_ca |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1807/16735 |