On Complexity Measures in Polynomial Calculus
Proof complexity is the study of different resources that a proof needs in different proof systems for propositional logic. This line of inquiry relates to the fundamental questions in theoretical computer science, as lower bounds on proof size for an arbitrary proof system would separate P from NP....
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
KTH, Teoretisk datalogi, TCS
2016
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-197278 http://nbn-resolving.de/urn:isbn:978-91-7729-226-5 |