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.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.