column

Open Problems Column

Author:

William GasarchAuthors Info & Claims

ACM SIGACT News, Volume 48, Issue 2

Pages 34 - 39

https://doi.org/10.1145/3106700.3106707

Published: 12 June 2017 Publication History

Get Access

References

[1]

M. Ajtai. Σ1/1-formulae on nite structures. Annals of Pure and Applied Logic, 24:1--48, 1983. http://www.sciencedirect.com/science/article/pii/0168007283900386?via%3Dihub.

Crossref

Google Scholar

[2]

L. Fortnow and S. Laplante. Circuit lower bounds à la Kolmogorov. Information and Computation, 15, 1995. http://www.sciencedirect.com/science/article/pii/S0890540185711613?via%3Dihub.

Digital Library

Google Scholar

[3]

M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13--27, April 1984.

Crossref

Google Scholar

[4]

J. Håstad. Almost optimal lower bounds for small depth circuits. In Proceedings of the Eighteenth Annual ACM Symposium on the Theory of Computing, Berkeley CA, pages 6--20, 1986.

Digital Library

Google Scholar

[5]

J. Håstad. Computational Limitations of small-Depth Circuits. MIT Press, Cambridge, MA, 1987.

Digital Library

Google Scholar

[6]

J. Håstad. Almost optimal lower bounds for small depth circuits. In S. Micali, editor, Ran- domness and Computation, pages 143--170, Greenwich, CT, 1989. JAI Press.

Google Scholar

[7]

J. Håstad, S. Jukna, and P. Pudlak. Top down lower bounds for depth-three circuits. Computational Complexity, 5, 1995.

Digital Library

Google Scholar

[8]

M. Karchmer. Communication Complexity: A new approach to circuit depth. MIT Press, Cambridge, MA, 1989.

Google Scholar

[9]

M. Karchmer and A. Wigderson. Monotone circuits for connectivity require superlogarithmic depth. SIAMJDM, 3(2):255--265, 1990. Earlier version in STOC 1988.

Digital Library

Google Scholar

[10]

E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, Cambridge, England, 1997.

Digital Library

Google Scholar

[11]

A. Razborov. Bounded arithmetic and lower bounds in boolean complexity. In P. Clote and J. Remmel, editors, Feasible Mathematics II, pages 344--386, 1995.

Crossref

Google Scholar

[12]

R. Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing, New York, pages 77--82, 1987.

Digital Library

Google Scholar

[13]

A. C. Yao. Separating the polynomial-time hierarchy by oracles. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, Portland OR, pages 1--10, 1985.

Digital Library

Google Scholar

Cited By

View all

Biktairov YStebelev MRudenko IShliazhko OYangel BLarochelle HRanzato MHadsell RBalcan MLin H(2020)PRANKProceedings of the 34th International Conference on Neural Information Processing Systems10.5555/3495724.3495939(2553-2563)Online publication date: 6-Dec-2020
https://dl.acm.org/doi/10.5555/3495724.3495939
Williams R(2019)Some Estimated Likelihoods for Computational ComplexityComputing and Software Science10.1007/978-3-319-91908-9_2(9-26)Online publication date: 2019
https://doi.org/10.1007/978-3-319-91908-9_2
Gasarch W(2014)Classifying Problems into Complexity Classes10.1016/B978-0-12-800160-8.00005-X(239-292)Online publication date: 2014
https://doi.org/10.1016/B978-0-12-800160-8.00005-X
Show More Cited By

Index Terms

Open Problems Column
1. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes

Index terms have been assigned to the content through auto-classification.

Recommendations

Column: Team Diagonalization

Ten years ago, Gla'er, Pavan, Selman, and Zhang [GPSZ08] proved that if P 6= NP, then all NP-complete sets can be simply split into two NP-complete sets. That advance might naturally make one wonder about a quite di erent potential consequence of NP-...
Open Problems Column

This issue's Open Problems Column is by Dana Moshkovitz. It is titled: Sliding Scale Conjec- tures in PCP. The PCP theorem has been around since 1992, but some of the most fundamental questions about it are still open. This column explains the questions,...
Open Problems Column

There have been two polls asking theorists (and others) what they thought of P vs NP and related questions [5, 6]. Both were written by me (William Gasarch) and appeared in the Complexity Column of SIGACT News, edited by Lane A. Hemaspaandra.

I have ...

Comments

Information & Contributors

Information

Published In

ACM SIGACT News Volume 48, Issue 2

June 2017

91 pages

ISSN:0163-5700

DOI:10.1145/3106700

Editor:
Stephen Fenner
University of South Carolina

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 June 2017

Published in SIGACT Volume 48, Issue 2

Check for updates

Qualifiers

Column

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
53
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Biktairov YStebelev MRudenko IShliazhko OYangel BLarochelle HRanzato MHadsell RBalcan MLin H(2020)PRANKProceedings of the 34th International Conference on Neural Information Processing Systems10.5555/3495724.3495939(2553-2563)Online publication date: 6-Dec-2020
https://dl.acm.org/doi/10.5555/3495724.3495939
Williams R(2019)Some Estimated Likelihoods for Computational ComplexityComputing and Software Science10.1007/978-3-319-91908-9_2(9-26)Online publication date: 2019
https://doi.org/10.1007/978-3-319-91908-9_2
Gasarch W(2014)Classifying Problems into Complexity Classes10.1016/B978-0-12-800160-8.00005-X(239-292)Online publication date: 2014
https://doi.org/10.1016/B978-0-12-800160-8.00005-X
Furia CMandrioli DMorzenti ARossi MFuria CMandrioli DMorzenti ARossi M(2012)Time in the Analysis of AlgorithmsModeling Time in Computing10.1007/978-3-642-32332-4_6(103-149)Online publication date: 29-Aug-2012
https://doi.org/10.1007/978-3-642-32332-4_6

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.

Cited By

Index Terms

Recommendations

Column: Team Diagonalization