Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,024,011 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.
2011
2011
A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem
D. Le
,
S. Cook
,
Yuli Ye
Annual Conference for Computer Science Logic
2011
Corpus ID: 2968919
Subramanian defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem…
Expand
2010
2010
Query Rewriting in DL-Lite_^(HN)_horn
E. Botoeva
,
A. Artale
,
Diego Calvanese
Description Logics
2010
Corpus ID: 8644583
In this paper we present practical algorithms for query answering and knowledge base satisfiability checking in DL-Lite ) horn…
Expand
2010
2010
Learning and Lower Bounds for AC0 with Threshold Gates
Parikshit Gopalan
,
R. Servedio
International Workshop and International Workshop…
2010
Corpus ID: 15617232
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently…
Expand
2009
2009
The complexity of Solitaire
L. Longpré
,
P. McKenzie
Theoretical Computer Science
2009
Corpus ID: 8783709
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
2005
2005
The Complexity of Finding Paths in Graphs with Bounded Independence Number
Arfst Nickelsen
,
Till Tantau
SIAM journal on computing (Print)
2005
Corpus ID: 37564006
We study the problem of finding a path between two vertices in finite directed graphs whose independence number is bounded by…
Expand
2004
2004
Constant Width Planar Computation Characterizes ACC0
Kristoffer Arnsfelt Hansen
Theory of Computing Systems
2004
Corpus ID: 10918911
Abstract We obtain a characterization of ACC0 in terms of a natural class of constant width circuits, namely in terms of constant…
Expand
2002
2002
On the computational power of Boolean decision lists
Matthias Krause
Computational Complexity
2002
Corpus ID: 36806538
Abstract.We study the computational power of decision lists over AND-functions versus $$ \hbox{threshold-}\oplus $$ circuits. AND…
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
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
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)
ACCEPT & CONTINUE