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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Subramanian defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem… 
2010
2010
In this paper we present practical algorithms for query answering and knowledge base satisfiability checking in DL-Lite ) horn… 
2010
2010
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently… 
2007
2007
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
We study the problem of finding a path between two vertices in finite directed graphs whose independence number is bounded by… 
2004
2004
Abstract We obtain a characterization of ACC0 in terms of a natural class of constant width circuits, namely in terms of constant… 
2002
2002
Abstract.We study the computational power of decision lists over AND-functions versus $$ \hbox{threshold-}\oplus $$ circuits. AND… 
1996
1996
In this paper we consider solutions to the static dictionary problem on AC/sup 0/ RAMs, i.e. random access machines where the… 
1981
1981
  • Stephen R. Mahaney
  • 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…