You are currently offline. Some features of the site may not work correctly.

# AC0

Known as: NC0
AC0 is a complexity class used in circuit complexity. It is the smallest class in the AC hierarchy, and consists of all families of circuits of depth… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
• SIGA
• 2017
• Corpus ID: 19986865
This paper surveys quantum learning theory: the theoretical aspects of machine learning using quantum computers. We describe the… Expand
Is this relevant?
Highly Cited
2014
Highly Cited
2014
• A. Tal
• Electron. Colloquium Comput. Complex.
• 2014
• Corpus ID: 5736203
We show that AC^0 circuits on n variables with depth d and size m have at most 2^{-Omega(k/log^{d-1} m)} of their Fourier mass at… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
• SIAM J. Comput.
• 2010
• Corpus ID: 35094715
The sign-rank of a matrix $A=[A_{ij}]$ with $\pm1$ entries is the least rank of a real matrix $B=[B_{ij}]$ with \$A_{ij}B_{ij}>0… Expand
Is this relevant?
2010
2010
• ICALP
• 2010
• Corpus ID: 2162502
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
• J. Artif. Intell. Res.
• 2009
• Corpus ID: 209509
The recently introduced series of description logics under the common moniker 'DL-Lite' has attracted attention of the… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
• M. Braverman
• 24th Annual IEEE Conference on Computational…
• 2009
• Corpus ID: 2327054
We prove that poly-sized AC^0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We prove that AC<sup>0</sup> cannot be efficiently simulated by MAJºMAJ circuits. Namely, we construct an AC<sup>0</sup> circuit… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
• H. Wee
• STOC '05
• 2005
• Corpus ID: 177254
We investigate the possibility of obfuscating point functions in the framework of Barak et al. from Crypto '01. A point function… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Priority queues are some of the most fundamental data structures. For example, they are used directly for task scheduling in… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
• 26th Annual Symposium on Foundations of Computer…
• 1985
• Corpus ID: 14140661
We explicitly construct, for every integer n and ε ≫ 0, a family of functions (psuedo-random bit generators) fn,ε:{0,1}nε → {0,1… Expand
Is this relevant?