Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,935,570 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.
S. S. 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
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
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
Review
2010
Review
2010
Provable Security for Physical Cryptography ⋆
Krzysztof Pietrzak
2010
Corpus ID: 18124933
The modern approach to cryptography is provable security, where one defines a meaningful formal security model and proves that…
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
1998
1998
On a Theory for AC0 and the Strength of the Induction Scheme
S. Kuroda
Mathematical Logic Quarterly
1998
Corpus ID: 16303473
We define a fragment of Primitive Recursive Arithmetic by replacing the defining axioms for primitive recursive functions by…
Expand
1996
1996
Static dictionaries on AC/sup 0/ RAMs: query time /spl theta/(/spl radic/log n/log log n) is necessary and sufficient
A. Andersson
,
Peter Bro Miltersen
,
Søren Riis
,
M. Thorup
Proceedings of 37th Conference on Foundations of…
1996
Corpus ID: 9232175
In this paper we consider solutions to the static dictionary problem on AC/sup 0/ RAMs, i.e. random access machines where the…
Expand
1990
1990
Tau-charm factory design
B. Barish
,
A. Odian
,
+50 authors
M. Nussbaum
1990
Corpus ID: 18269472
1981
1981
On the number of P-isomorphism classes of NP-complete sets
Stephen R. Mahaney
22nd Annual Symposium on Foundations of Computer…
1981
Corpus ID: 846753
All known NP-complete sets are P-isomorphic (i.e. there are polynomial time, one-to-one and onto, polynomial time invertible…
Expand