Optimal Proof Systems and Sparse Sets

Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek. Optimal Proof Systems and Sparse Sets. In Horst Reichel, Sophie Tison, editors, STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings. Volume 1770 of Lecture Notes in Computer Science, pages 407-418, Springer, 2000. [doi]

@inproceedings{BuhrmanFFM00,
  title = {Optimal Proof Systems and Sparse Sets},
  author = {Harry Buhrman and Stephen A. Fenner and Lance Fortnow and Dieter van Melkebeek},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1770/17700407.htm},
  researchr = {https://researchr.org/publication/BuhrmanFFM00},
  cites = {0},
  citedby = {0},
  pages = {407-418},
  booktitle = {STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings},
  editor = {Horst Reichel and Sophie Tison},
  volume = {1770},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67141-2},
}