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. 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
{"_id":"g575xftX52hXqDix9","bibbaseid":"fortnow-nondeterministicpolynomialtimeversusnondeterministiclogarithmicspacetimespacetradeoffsforsatisfiability-1997","downloads":0,"creationDate":"2016-02-09T20:13:37.562Z","title":"Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability","author_short":["Fortnow, L."],"year":1997,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/coco/Fortnow97","bibdata":{"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","bibtex":"@inproceedings{ dblp4516918,\n title = {Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability},\n author = {Lance Fortnow},\n author_short = {Fortnow, L.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {1997},\n key = {dblp4516918},\n id = {dblp4516918},\n biburl = {http://www.dblp.org/rec/bibtex/conf/coco/Fortnow97},\n url = {http://doi.ieeecomputersociety.org/10.1109/CCC.1997.612300},\n conference = {IEEE Conference on Computational Complexity},\n pages = {52-60},\n text = {IEEE Conference on Computational Complexity 1997:52-60},\n booktitle = {Proceedings of IEEE Conference on Computational Complexity}\n}","bibbaseid":"fortnow-nondeterministicpolynomialtimeversusnondeterministiclogarithmicspacetimespacetradeoffsforsatisfiability-1997","role":"author","urls":{"Paper":"http://doi.ieeecomputersociety.org/10.1109/CCC.1997.612300"},"downloads":0},"search_terms":["nondeterministic","polynomial","time","versus","nondeterministic","logarithmic","space","time","space","tradeoffs","satisfiability","fortnow"],"keywords":[],"authorIDs":["56ba470d16a1deb95500038d"],"dataSources":["qi6TcSFzt7GAGtXPJ"]}