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)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Arjunan Jeevalatha, Swarup Kumar Chakrabarti, +4 authors Bir Pal Singh
- Phytoparasitica
- 2017

The complete coat protein (cp) gene sequence of eighty Tomato leaf curl New Delhi virus-[potato] (ToLCNDV-[potato]) isolatesâ€¦Â (More)

Is this relevant?

2014

2014

- Pranav Pankaj Sahu, Namisha Sharma, Swati M Puranik, Manoj Prasad
- Plant Molecular Biology Reporter
- 2014

Tomato leaf curl disease (ToLCD), caused by strains of Tomato leaf curl virus, is major constraint to tomato production globallyâ€¦Â (More)

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)

Is this relevant?

2008

2008

- Krista L. Moulder, Xiaoping Jiang, +5 authors Steven J Mennerick
- 2008

Glutamate generates fast postsynaptic depolarization throughout the CNS. The positive-feedback nature of glutamate signalingâ€¦Â (More)

Is this relevant?

2004

2004

- Jean-Camille Birget
- IJAC
- 2004

We prove new results about the remarkable infinite simple groups introduced by Richard Thompson in the 1960s. We give a faithfulâ€¦Â (More)

Is this relevant?

2004

2004

- Abdourahamane SangarÃ©, D. Deng, Claude M. Fauquet, Roger N. Beachy
- Molecular Breeding
- 2004

We constructed a mutation in DNA A of African cassava mosaic virus (ACMV) to alter the putative NTP-binding site in theâ€¦Â (More)

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)

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)

Is this relevant?

1993

1993

- Eric Allender, Jia Jiao
- STOC
- 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

- Jeff Edmonds, Steven Rudich, Russell Impagliazzo, JirÃ Sgall
- computational complexity
- 1991

Karchmer, Raz, and Wigderson (1995) discuss the circuit depth complexity of n-bit Boolean functions constructed by composing upâ€¦Â (More)

Is this relevant?