Skip to search formSkip to main contentSkip to account menu

ACC0

Known as: ACC, ACC (complexity) 
ACC0, sometimes called ACC, is a class of computational models and problems defined in circuit complexity, a field of theoretical computer science… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
AC0AND gateComputing the permanentFan-in

Broader (1)

Circuit complexity

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
$AC^0[p]$ Lower Bounds and NP-Hardness for Variants of MCSP
  • Rahul Ilango
  • Electron. Colloquium Comput. Complex.
  • 2019
  • Corpus ID: 67867891
6 The Minimum Circuit Size Problem (MCSP) asks whether a (given) Boolean function has a circuit 7 of at most a (given) size… 
2018
2018
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds
We give a deterministic algorithm for counting the number of satisfying assignments of any AC^0[oplus] circuit C of size s and… 
2017
2017
7 : 2 On the Average-Case Complexity of MCSP and Its Variants
We prove various results on the complexity of MCSP (Minimum Circuit Size Problem) and the related MKTP (Minimum Kolmogorov Time… 
2014
2014
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth
We study the complexity of several of the classical graph decision problems in the setting of bounded cutwidth and how imposing… 
2013
2013
Represent MOD function by low degree polynomial with unbounded one-sided error
In this paper, we prove tight lower bounds on the smallest degree of a nonzero polynomial in the ideal generated by $MOD_q$ or… 
2010
2010
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
In this paper, we give the first construction of a pseudorandom generator, with seed length O(log n), for CC0[p], the class of… 
2007
2007
On the Complexity of Hard-Core Set Constructions
We study a fundamental result of Impagliazzo (FOCS'95) known as the hard-core set lemma. Consider any function f : {0, 1}n → {0… 
2004
2004
Constant Width Planar Computation Characterizes ACC0
Abstract We obtain a characterization of ACC0 in terms of a natural class of constant width circuits, namely in terms of constant… 
1996
1996
\structure and Complexity"
S On the Power of Randomized Branching Programs Farid Ablayev Kazan University (joint work with Marek Karpinski, Universitat… 
1993
1993
n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom
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)