A. K. Chandra, L. Stockmeyer, and U. Vishkin. Constant Depth Reducibility. SIAM Journal on Computing, 13(2):423--439, 1984. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Uniform Constant-Depth Threshold Circuits for Division and.. - Hesse, Allender (2002) (1 citation) (Correct)
Restricted Branching Programs and Hardware Verification - Ponzio (1995) (9 citations) (Correct)
Static Dictionaries on AC^0 RAMs: Query time.. - Andersson.. (1996) (Correct)
Dictionaries on AC^0 RAMs: Query Time.. - Andersson.. (1997) (Correct)
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets - Cai, Sivakumar (1995) (3 citations) (Correct)
Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis - Cai, Sivakumar (Correct)
Uniform Circuits for Division: Consequences and Problems - Allender, Barrington, Hesse (2000) (2 citations) (Correct)
A Framework for Parallel Job Scheduling - Subramanian (1995) (Correct)
Counting, Fanout, And The Complexity Of Quantum Acc - Green, al. (2002) (1 citation) (Correct)
A Computational Taxonomy and Survey of Neural Network Models - Sima, Orponen (2001) (1 citation) (Correct)
On the Circuit Complexity of Sigmoid Feedforward Neural Networks - Beiu, Taylor (1996) (Correct)
The Computational Theory of Neural Networks - Sima (2000) (Correct)
On Proofs About Threshold Circuits and Counting Hierarcies.. - Johannsen, Pollett (1998) (3 citations) (Correct)
Bounds for the Computational Power and Learning Complexity of.. - Maass (1997) (33 citations) (Correct)
VTC0: A Second-Order Theory for TC0 - Nguyen, Cook (Correct)
Uniform Constant-Depth Threshold Circuits for Division and .. - Hesse, Allender, al. (2002) (1 citation) (Correct)
A Lower Bound for Primality - Eric Allender Dept (1999) (2 citations) (Correct)
Complexity Classes - Allender, Loui, Regan (Correct)
On Small Depth Threshold Circuits - Alexander Razborov Steklov (1992) (9 citations) (Correct)
The Graph of Multiplication is Equivalent to Counting - Buss (1991) (9 citations) (Correct)
On TC^0, AC^0, and Arithmetic Circuits - Agrawal, Allender, Datta (2000) (Correct)
Hashing, Randomness and Dictionaries - Pagh (2002) (Correct)
The Complexity of Planarity Testing - Allender, Mahajan (2003) (1 citation) (Correct)
Extensions to Barrington's M-program Model - Bedard, Lemieux, McKenzie (16 citations) (Correct)
Finite Groupoids and their Applications to Computational Complexity - Lemieux (1996) (3 citations) (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC