Affiliation:
1. University of Maryland, College Park, MD, USA
Abstract
There have been two polls asking theorists (and others) what they thought of P vs NP and related questions [5, 6]. Both were written by me (William Gasarch) and appeared in the Complexity Column of SIGACT News, edited by Lane A. Hemaspaandra.
I have conducted a third poll. The results of that poll will appear in Lane's column in this issue (Volume 50, Number 1, March 2019). In the article I did not give my own answers [though I commented on other people's answers in square brackets]. By contrast, this column contains my answers about the status of P vs. NP. For information on what is the status of P vs NP see Scott Aaronson's article [1], Lance Fortnow's article [3], or (for the layperson) Lance Fortnow's book [4].
Publisher
Association for Computing Machinery (ACM)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献