Jeremy Avigad. Plausibly hard combinatorial tautologies. In Paul Beam, Samuel R. Buss, editors, Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996. Volume 39 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1-12, DIMACS/AMS, 1996.
@inproceedings{Avigad96-0,
title = {Plausibly hard combinatorial tautologies},
author = {Jeremy Avigad},
year = {1996},
researchr = {https://researchr.org/publication/Avigad96-0},
cites = {0},
citedby = {0},
pages = {1-12},
booktitle = {Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996},
editor = {Paul Beam and Samuel R. Buss},
volume = {39},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
publisher = {DIMACS/AMS},
}