• DOI:10.1145/564585.564599
Corpus ID: 36828694

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

View on ACM

people.csail.mit.edu

Save to Library

Create Alert

Cite

Launch Research Feed