skip to main content
article

SIGACT news complexity theory column 53

Published: 01 December 2006 Publication History

Abstract

A way-cool new project and web site has been created by Greg Kuperberg. Greg is trying to graphically capture the known (for now, relativizable) relationships between classes, and to make clear to everyone what open questions remain. The starting point for Greg's "Complexity Zoology" site is www.math.ucdavis.edu/~greg/zoology/. Greg welcomes feedback, corrections, and (best of all) new or missed results.

References

[1]
{Ajt83} M. Ajtai, Σ1/1-formulae on finite structures, Ann. Pure Applied Logic 24, 1--48, 1983.
[2]
{BGS75} T. Baker, J. Gill, and R. Solovay, Relativizations of the P =? NP question, SIAM J. Comput. 4(4), 431--442, 1975.
[3]
{BDG89} J. Balcázar, J. Díaz, and J. Gabarró, Structural Complexity I & II, Springer, 1989 and 1990.
[4]
{Cai86} J-Y. Cai, With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy, in Proc. 18th ACM Sympos. on Theory of Comput. (STOC'89), 21--29, 1986. (The final version appeared in J. Comp. Syst. Sci. 38(1), 68--85, 1989.)
[5]
{Cai01} J-Y. Cai, SP/2 ⊆ ZPPNP, in Proc. 42th IEEE Symposium on Foundations of Computer Science (FOCS'01), IEEE, 620--628, 2001.
[6]
{CW03} J-Y. Cai and O. Watanabe, On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results, Proc. 9th International Computing and Combinatorics Conference (COCOON'03), LNCS 2697, 202--211, 2003. (The journal version appeared in SIAM J. Comput. 33(4), 989--1009, 2004.)
[7]
{CW04} J-Y. Cai and O. Watanabe, Relativized collapsing between BPP and PH under stringent oracle access, Inform. Process. Lett. 90, 147--154, 2004.
[8]
{CW06} J-Y. Cai and O. Watanabe, Random access to advice strings and collapsing results, Algorithmica, to appear.
[9]
{For05} L. Fortnow, personal communication, 2005.
[10]
{FSS81} M. Furst, J. Saxe, and M. Sipser, Parity, circuits, and the polynomial time hierarchy, in Proc. 22nd IEEE Symposium on Foundations of Computer Science (FOCS'81), IEEE, 260--270, 1981.
[11]
{Hås86} J. Håstad, Almost optimal lower bounds for small depth circuits, in Proc. 18th ACM Symposium on Theory of Computing (STOC'86), ACM, 6--20, 1986.
[12]
{HO02} L. Hemaspaandra and M. Ogihara, The Complexity Theory Companion, Springer, 2002.
[13]
{Kan82} R. Kannan, Circuit-size lower bounds and non-reducibility to sparse sets, Information and Control 55, 40--56, 1982.
[14]
{NW94} N. Nisan and A. Wigderson, Hardness vs randomness, J. Comput. Syst. Sci. 49, 149--167, 1994.
[15]
{Raz87} A. Razborov, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Mathematical Notes of the Academy of Sciences of the USSR 41, 333--338, 1987.
[16]
{Smo87} R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in Proc. 19th ACM Symposium on Theory of Computing (STOC'87), ACM, 77--82, 1987.
[17]
{Wil83} C. B. Wilson, Relativized circuit complexity, in Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS'83), IEEE, 329--334, 1983.
[18]
{Yao85} A. C. Yao, Separating the polynomial-time hierarchy by oracles, in Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS'85), IEEE, 1--10, 1985.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News
ACM SIGACT News  Volume 37, Issue 4
December 2006
117 pages
ISSN:0163-5700
DOI:10.1145/1189056
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2006
Published in SIGACT Volume 37, Issue 4

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 149
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 26 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media