Resolution proofs of generalized pigeonhole principles

Resolution proofs of generalized pigeonhole principles (1988)

by Samuel R. Buss , Győrgy Turán

Venue:	Theoretical Computer Science
Citations:	51 - 4 self

Datum	Value	Source
TITLE	Resolution proofs of generalized pigeonhole principles	INFERENCE
AUTHOR NAME	Samuel R. Buss	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Mathematics; University of California, Berkeley	SVM HeaderParse 0.2
AUTHOR NAME	Győrgy Turán	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Mathematics, Statistics, and Computer Science; University of Illinois, Chicago; and; Automata Theory Research Group; Hungarian Academy of Sciences	SVM HeaderParse 0.2
AUTHOR ADDR	Szeged, Hungary	SVM HeaderParse 0.2
ABSTRACT	We extend results of A. Haken to give an exponential lower bound on the size of resolution proofs for propositional formulas encoding a generalized pigeonhole principle. These propositional formulas express the fact that there is no one-one mapping from c · n objects to n objects when c>1. As a corollary, resolution proof systems do not p-simulate constant formula depth Frege proof systems. 1.	SVM HeaderParse 0.2
YEAR	1988	SVM HeaderParse 0.2
VENUE	Theoretical Computer Science	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	311--317	INFERENCE
VOLUME	62	INFERENCE
CITATIONS	7 found	ParsCit 1.0