External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Plausibly hard combinatorial tautologies

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.

Abstract

Abstract is missing.

runs on