SIGACT news complexity theory column 36

@article{Hemaspaandra2002SIGACTNC,
  title={SIGACT news complexity theory column 36},
  author={L. A. Hemaspaandra},
  journal={SIGACT News},
  year={2002},
  volume={33},
  pages={34-47}
}
  • L. A. Hemaspaandra
  • Published 2002
  • Computer Science
  • SIGACT News
  • This current issue's guest column is by Bill Gasarch, and reports on a poll he has conducted on the most famous open question in complexity theory: P=?NP. If Mitsunori Ogihara's prediction that P-vs-NP will not be resolved until the year 3000 is correct, my guess is more than a few students of the history of computer theory will be visiting, long after all the contributors are gone, Bill's column, which will provide a time capsule into the thoughts of many in the field. Who knows? Perhaps there… CONTINUE READING
    22 Citations
    Markets are efficient if and only if P = NP
    • Philip Maymin
    • Mathematics, Computer Science
    • Algorithmic Finance
    • 2011
    • 15
    • Highly Influenced
    • PDF
    Rewriting methods in higher algebra
    • 1
    • PDF
    Some Estimated Likelihoods for Computational Complexity
    • R. Williams
    • Computer Science
    • Computing and Software Science
    • 2019
    • 9
    • PDF
    Open Problems Column
    • 1
    Analysis of Algorithms and Partial Algorithms
    • 1
    • PDF
    P\mathop{ =}\limits^{?}NP
    • 2
    Classifying Problems into Complexity Classes
    • 6
    • PDF
    Computing equilibria: a computational complexity perspective
    • T. Roughgarden
    • Mathematics, Computer Science
    • Electron. Colloquium Comput. Complex.
    • 2015
    • 47
    • PDF
    Understanding SAT is in P
    • 1
    • PDF