Cited By
View all- Cherng HHannum ELu C(2014)ChinaThe Palgrave Handbook of Race and Ethnic Inequalities in Education10.1057/9781137317803_8(205-237)Online publication date: 2014
Introduction
Abstract
Warmest thanks to Salil Vadhan for this issue's wonderful guest column on pseudorandomness. (His column begins in a few pages.) Future columns include Arnaud Durand, Clemens Lautemann, and Malika More on A Simple Proof of Polylog Counting Ability of First-Order Logic, Jonathan Buss and Tarique Islam on Complexity of Fixed-Parameter Problems, and Jin-Yi Cai on holographic algorithms.
References
[1]
{AHH+93} V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, and T. Thierauf. Reductions to sets of low information content. In K. Ambos-Spies, S. Homer, and U. Schöning, editors, Complexity Theory, pages 1--45. Cambridge University Press, 1993.
[2]
{AKM92} V. Arvind, J. Köbler, and M. Mundhenk. On bounded truth-table, conjunctive, and randomized reductions to sparse sets. In Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 140--151. Springer-Verlag Lecture Notes in Computer Science #652, 1992.
[3]
{BC93} D. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice-Hall, 1993.
[4]
{Ber76} L. Berman. On the structure of complete sets. In Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, pages 76--80. IEEE Computer Society, October 1976.
[5]
{CNS95} J. Cai, A. Naik, and D. Sivakumar. On the existence of hard sparse sets under weak reductions. Technical Report 95--31, Department of Computer Science, State University of New York at Buffalo, Buffalo, NY, July 1995.
[6]
{CS99} J. Cai and D. Sivakumar. Sparse hard sets for P: Resolution of a conjecture of Hartmanis. Journal of Computer and System Sciences, 58(2):280--296, 1999.
[7]
{CS00} J. Cai and D. Sivakumar. Resolution of Hartmanis' conjecture for NL-hard sparse sets. Theoretical Computer Science, 240(2):457--469, 2000.
[8]
{GH00} C. Glaßer and L. Hemaspaandra. A moment of perfect clarity II: Consequences of sparse sets hard for NP with respect to weak reductions. SIGACT News, 31(4):39--51, 2000.
[9]
{Gla00} C. Glaßer. Consequences of the existence of sparse sets hard for NP under a subclass of truth-table reductions. Technical Report TR 245, Institut für Informatik, Universität Würzburg, Würzburg, Germany, January 2000.
[10]
{HM80} J. Hartmanis and S. Mahaney. An essay about research on sparse NP complete sets. In Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science, pages 40--57. Springer-Verlag Lecture Notes in Computer Science #88, September 1980. TR version available online as hdl.handle.net/1813/6262.
[11]
{Koz06} D. Kozen. Theory of Computation. Springer-Verlag, 2006.
[12]
{Mah82} S. Mahaney. Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis. Journal of Computer and System Sciences, 25(2):130--143, 1982.
[13]
{Mah86} S. Mahaney. Sparse sets and reducibilities. In R. Book, editor, Studies in Complexity Theory, pages 63--118. John Wiley and Sons, 1986.
[14]
{Mah89} S. Mahaney. The Isomorphism Conjecture and sparse sets. In J. Hartmanis, editor, Computational Complexity Theory, pages 18--46. American Mathematical Society, 1989. Proceedings of Symposia in Applied Mathematics #38.
[15]
{OW91} M. Ogiwara and O. Watanabe. On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal on Computing, 20(3):471--483, June 1991.
[16]
{RR92} D. Ranjan and P. Rohatgi. On randomized reductions to sparse sets. In Proceedings of the 7th Structure in Complexity Theory Conference, pages 239--242. IEEE Computer Society Press, June 1992.
[17]
{You92} P. Young. How reductions to sparse sets collapse the polynomial-time hierarchy: A primer part II: Restricted polynomial-time reductions. SIGACT News, 23(4):83--94, 1992.
Index Terms
- Introduction
Recommendations
Introduction
Complexity of ConstraintsThe first systematic complexity-theoretic study of constraintswas carried out by T.J. Schaefer in 1978 with a paper on Booleanconstraint satisfaction problems (CSPs). This volume opens with asurvey of Boolean constraints by N. Creignou and H. ...
Introduction to Special Section on Probabilistic Proof Systems
The study of probabilistically verifiable proofs originated in the mid 1980s with the introduction of Interactive Proof Systems (IPs). The primary focus of research in this area in the '80s has been twofold: the role of zero-knowledge interactive proofs ...
Introduction
On December 5, 1997, a small conference was held at McGill on the occasion of Jim Lambek's 75th birthday. Subsequently it was decided to publish two volumes of papers contributed in his honour to mark this occasion: this issue of Mathematical Structures ...
Comments
Information & Contributors
Information
Published In
Copyright © 2007 Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 September 2007
Published in SIGACT Volume 38, Issue 3
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 121Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 22 Sep 2024
Other Metrics
Citations
Cited By
View all- Cherng HHannum ELu C(2014)ChinaThe Palgrave Handbook of Race and Ethnic Inequalities in Education10.1057/9781137317803_8(205-237)Online publication date: 2014
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in