Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,689,044 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
AC0
AND gate
Computing the permanent
Fan-in
Expand
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…
Expand
2018
2018
Simultaneous Multiparty Communication Protocols for Composed Functions.
Yassine Hamoudi
2018
Corpus ID: 260498470
2017
2017
7 : 2 On the Average-Case Complexity of MCSP and Its Variants
Shuichi Hirahara
,
R. Santhanam
2017
Corpus ID: 27013067
We prove various results on the complexity of MCSP (Minimum Circuit Size Problem) and the related MKTP (Minimum Kolmogorov Time…
Expand
2017
2017
Title : On lower bounds for circuit complexity and algorithms for satisfiability
Albert Atserias Peri
2017
Corpus ID: 164215375
This work is devoted to explore the novel method of proving circuit lower bounds for the class NEXP by Ryan Williams. Williams is…
Expand
Review
2014
Review
2014
Fast Circuit Satisfiability Algorithms and Applications
Kevin Shi kshi
2014
Corpus ID: 50668270
We survey circuit complexity theory, satisfiability algorithms for circuits, and the recent framework of Ryan Williams’s for…
Expand
2013
2013
Represent MOD function by low degree polynomial with unbounded one-sided error
Chris Beck
,
Yuan Li
arXiv.org
2013
Corpus ID: 12373150
In this paper, we prove tight lower bounds on the smallest degree of a nonzero polynomial in the ideal generated by $MOD_q$ or…
Expand
2012
2012
T C C C
R. Santhanam
2012
Corpus ID: 50550541
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The…
Expand
Review
2007
Review
2007
Circuit Complexity of Regular Languages
M. Koucký
Theory of Computing Systems
2007
Corpus ID: 18630158
We survey the current state of knowledge on the circuit complexity of regular languages and we prove that regular languages that…
Expand
1997
1997
The Permanent Requires Large Uniform Threshold Circuits 1
Eric Allender
1997
Corpus ID: 15313058
A recent paper by Caussinus, McKenzie, Th erien, and Vollmer [CMTV96] shows that there are problems in the counting hierarchy…
Expand
1996
1996
\structure and Complexity"
Eric Allender
,
K. Wagner
,
+6 authors
G. Wechsung
1996
Corpus ID: 17445622
S On the Power of Randomized Branching Programs Farid Ablayev Kazan University (joint work with Marek Karpinski, Universitat…
Expand