AC (complexity)

Known as: AC, AC hierarchy 
In circuit complexity, AC is a complexity class hierarchy. Each class, ACi, consists of the languages recognized by Boolean circuits with depth and a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2017
012319712017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The complete coat protein (cp) gene sequence of eighty Tomato leaf curl New Delhi virus-[potato] (ToLCNDV-[potato]) isolates… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
Tomato leaf curl disease (ToLCD), caused by strains of Tomato leaf curl virus, is major constraint to tomato production globally… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 5
Is this relevant?
2009
2009
Nine membrane-bound mammalian adenylyl cyclases (ACs) have been identified. Type 1 and 8 ACs (AC1 and AC8), which are both… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Glutamate generates fast postsynaptic depolarization throughout the CNS. The positive-feedback nature of glutamate signaling… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2004
2004
We prove new results about the remarkable infinite simple groups introduced by Richard Thompson in the 1960s. We give a faithful… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
2004
We constructed a mutation in DNA A of African cassava mosaic virus (ACMV) to alter the putative NTP-binding site in the… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2002
2002
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC… (More)
  • figure 1
Is this relevant?
2000
2000
Recently, Arts and Giesl introduced the notion of dependency pairs, which gives effective methods for proving termination of term… (More)
  • figure 3.1
  • figure 3.2
  • figure 5.1
  • figure 5.2
  • figure 5.3
Is this relevant?
1993
1993
We show that for every family of arithmetic circuits of polynomial size and degree over the algebra (Z*, max, concat ), there is… (More)
Is this relevant?
1991
1991
Karchmer, Raz, and Wigderson (1995) discuss the circuit depth complexity of n-bit Boolean functions constructed by composing up… (More)
Is this relevant?