Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,093,980 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
AC (complexity)
ACC0
AND gate
BIT predicate
Expand
Broader (1)
Circuit complexity
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Secret Sharing Schemes : A Fine Grained Analysis.
Shion Samadder Chaudhury
,
Sabyasachi Dutta
,
K. Sakurai
2019
Corpus ID: 209422622
In this paper we prove that embedding parity bits and other function outputs in share string enables us to construct a secret…
Expand
2017
2017
Near-Optimal Secret Sharing and Error Correcting Codes in AC0
Kuan Cheng
,
Y. Ishai
,
Xin Li
IACR Cryptology ePrint Archive
2017
Corpus ID: 3669326
We study the question of minimizing the computational complexity of (robust) secret sharing schemes and error correcting codes…
Expand
2017
2017
Learning AC0 Under k-Dependent Distributions
Ning Ding
,
Yan-Li Ren
,
Da-Wu Gu
Theory and Applications of Models of Computation
2017
Corpus ID: 40032504
It is well known that \(AC^0\) circuits can be learned by the Low Degree Algorithm in quasi-polynomial-time under the uniform…
Expand
2014
2014
On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness
Michael Elberfeld
,
Christoph Stockhusen
,
Till Tantau
Algorithmica
2014
Corpus ID: 253980044
The parameterized complexity of a problem is generally considered “settled” once it has been shown to be fixed-parameter…
Expand
2013
2013
Generalized Quantifier Distribution and Semantic Complexity
Camilo Thorne
,
Jakub Szymanik
2013
Corpus ID: 15224932
We study in this paper the correlation between the semantic (data) complexity of first order, proportional, aggregate and Ramsey…
Expand
2012
2012
Madhu Sudan ) — October 25 , 2012
M. Dana
,
Scribe
,
Wang Cheung
,
Chi
2012
Corpus ID: 15967510
Randomness is an incredibly useful phenomenon, with applications in many fields. We can solve some problems using randomness…
Expand
2011
2011
Feasible interpolation for lifted sequents
Phuong Nguyen
2011
Corpus ID: 8392057
The idea of feasible interpolation for propositional proof systems is to derive lower bounds for propositional proofs using…
Expand
2010
2010
On quantum computing and pseudorandomness
W. J. Fefferman
2010
Corpus ID: 14231430
The relationship between efficient verification and quantum computing is one of the most important and least well-understood…
Expand
2007
2007
Characterizations of some complexity classes between Θ p 2 and ∆ p 2
J. Castro
2007
Corpus ID: 11574013
We give some characterizations of the classes P [O(log n)]. First, we show that these classes are equal to classes ACk−1(NP…
Expand
1990
1990
Tau-charm factory design
B. Barish
,
A. Odian
,
+50 authors
M. Nussbaum
1990
Corpus ID: 18269472