Propositional Proof Complexity an Introduction

  • Buss S
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article is an abridged and revised version of a 1996 McGill University technical report [15]. The technical report was based on lectures delivered by the author at a workshop in Holetown, Barbados and on the authors prepared overhead transparencies. The audience at this workshop wrote scribe notes which then formed the technical report [15]. The material selected for the present article corresponds roughly to the content of the author's lectures at the NATO summer school held in Marktoberdorf, Germany in July-August 1997.

Cite

CITATION STYLE

APA

Buss, S. R. (1999). Propositional Proof Complexity an Introduction. In Computational Logic (pp. 127–178). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-58622-4_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free