The future of computational complexity theory: part I

  • Authors:
  • Christos H. Papadimitriou;Oded Goldreich;Avi Wigderson;Alexander A. Razborov;Michael Sipser

  • Affiliations:
  • Computer Science, University of California, Berkeley;-;-;-;-

  • Venue:
  • ACM SIGACT News
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

As you probably already know, there is an active discussion going on---in forums ranging from lunch-table conversations to workshops on "strategic directions" to formal reports---regarding the future of theoretical computer science. Since your complexity columnist does not know The Answer, I've asked a number of people to contribute their comments on the narrower issue of the future of complexity theory. The only ground rule was a loose 1-page limit; each contributor could choose what aspect(s) of the future to address, and the way in which to address them. The first installment of contributions appears in this issue, and one or two more installments will appear among the next few issues.Also coming during the next few issues: the search for the perfect theory journal, and (for the sharp-eyed) Lance Fortnow dons a clown suit. Finally, let me mention that work of Russell Impagliazzo resolves one of the open questions from Complexity Theory Column 11.