Christos H. Papadimitriou
Oded Goldreich
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.
- {BTT92} Bartholdi, J.J., III; Tovey, C.A.; Trick, M. "How hard is it to control an election?" Mathematical and Computer Modelling, Aug.-Sept. 1992, vol. 16, (no. 8-9):27-40.Google Scholar
- {BPT91} Buss, S.R.; Papadimitriou, C.H.; Tsitsiklis, J.N. "On the predictability of coupled automata: an allegory about chaos," Complex Systems, Oct. 1991, vol. 5, (no. 5):525- 39. Also, Proc. 1990 FOCS.Google Scholar
- {CPM94} Cowan, G.A.; Pines, D.; Meltzer, D. Complexity: Metaphors, models, and reality, Santa Fe, 1994. Google ScholarDigital Library
- {DP94} Deng, X.; Papadimitriou, C.H. "The complexity of solution concepts," Mathematics of Operations Research, 19, 2, pp. 257-266, 1994. Google ScholarDigital Library
- {GKPS95} Gogic, G.; Kautz, H.; Papadimitriou, C.H.; Selman, B. "The comparative linguistics of knowledge representation," Proc. 1995 IJCAI. Google ScholarDigital Library
- {HILL91} J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. Construction of a pseudorandom generator from any one-way function. Technical Report 91-068, ICSI, Berkeley, 1991.Google Scholar
- {HLY80} Honeyman, P.; Ladner, R.E.; Yannakakis, M. "Testing the universal instance assumption," Information Processing Letters, 12 Feb. 1980, vol. 10, (no. 1):14-19.Google Scholar
- {HRZ95} L. Hemaspaandra, A. Ramachandran, and M. Zimand. Worlds to die for. SIGACT News, 26(4):5-15, 1995. Google ScholarDigital Library
- {Imp96} R. Impagliazzo. Very strong one-way functions and pseudo-random generators exist relative to a random oracle. Manuscript, January 1996.Google Scholar
- {Knu74} Knuth, D.E. "A terminological proposal," SIGACT News, 6, 1, 12-18, 1974.Google Scholar
- {Pap96} Papadimitriou, C.H. "The complexity of knowledge representation," invited paper in the Proc. 1996 Computational Complexity Conference. Google ScholarDigital Library
- {PY94} Papadimitriou, C.H.; Yannakakis, M. "Complexity as bounded rationality," Proc. 1994 STOC. Google ScholarDigital Library
- {Zim96} M. Zimand. How to privatize random bits. Technical Report TR-616, University of Rochester, Department of Computer Science, Rochester, NY, April 1996. Google ScholarDigital Library
Index Terms
- The future of computational complexity theory: part I
Recommendations
The future of computational complexity theory: part II
This is the final part of a 2-part column on the future of computational complexity theory. The grounds rules were that the contributors had no restrictions (except a 1-page limit). For readers interested in more formal reports, in addition to the two ...
SIGACT news complexity theory column 36
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,...
SIGACT news complexity theory column 35
I was surprised and delighted at a recent conference when the complexity class Θ2p suddenly popped up in a talk (by Markus Holzer on work by him and Pierre McKenzie) where it is was not exactly something one would have before-hand expected to come into ...
Comments