A lower bound on the size of resolution proofs of the Ramsey theorem - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Pavel Pudlák. A lower bound on the size of resolution proofs of the Ramsey theorem. Electronic Colloquium on Computational Complexity (ECCC), 18:162, 2011. [doi]

@article{Pudlak11,
  title = {A lower bound on the size of resolution proofs of the Ramsey theorem},
  author = {Pavel Pudlák},
  year = {2011},
  url = {http://eccc.hpi-web.de/report/2011/162},
  researchr = {https://researchr.org/publication/Pudlak11},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {18},
  pages = {162},
}

runs on WebDSL