Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability. Fortnow, L. In Proceedings of IEEE Conference on Computational Complexity, pages 52-60, 1997.
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability [link]Paper  bibtex   
@inproceedings{ dblp4516918,
  title = {Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability},
  author = {Lance Fortnow},
  author_short = {Fortnow, L.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {1997},
  key = {dblp4516918},
  id = {dblp4516918},
  biburl = {http://www.dblp.org/rec/bibtex/conf/coco/Fortnow97},
  url = {http://doi.ieeecomputersociety.org/10.1109/CCC.1997.612300},
  conference = {IEEE Conference on Computational Complexity},
  pages = {52-60},
  text = {IEEE Conference on Computational Complexity 1997:52-60},
  booktitle = {Proceedings of IEEE Conference on Computational Complexity}
}

Downloads: 0