Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
AC (complexity)ACC0AND gateBIT predicate

Broader (1)

Circuit complexity

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Near-Optimal Secret Sharing and Error Correcting Codes in AC0
We study the question of minimizing the computational complexity of (robust) secret sharing schemes and error correcting codes… 
2014
2014
On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness
The parameterized complexity of a problem is generally considered “settled” once it has been shown to be fixed-parameter… 
2011
2011
Feasible interpolation for lifted sequents
The idea of feasible interpolation for propositional proof systems is to derive lower bounds for propositional proofs using… 
Review
2010
Review
2010
Provable Security for Physical Cryptography ⋆
The modern approach to cryptography is provable security, where one defines a meaningful formal security model and proves that… 
2007
2007
Characterizations of some complexity classes between Θ p 2 and ∆ p 2
We give some characterizations of the classes P [O(log n)]. First, we show that these classes are equal to classes ACk−1(NP… 
2005
2005
The Complexity of Finding Paths in Graphs with Bounded Independence Number
We study the problem of finding a path between two vertices in finite directed graphs whose independence number is bounded by… 
1998
1998
On a Theory for AC0 and the Strength of the Induction Scheme
We define a fragment of Primitive Recursive Arithmetic by replacing the defining axioms for primitive recursive functions by… 
1996
1996
Static dictionaries on AC/sup 0/ RAMs: query time /spl theta/(/spl radic/log n/log log n) is necessary and sufficient
In this paper we consider solutions to the static dictionary problem on AC/sup 0/ RAMs, i.e. random access machines where the… 
1990
1990
Tau-charm factory design
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)