M. Sipser. Borel sets and circuit complexity. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 61-69, 1983. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
Complete Problems for Dynamic Complexity Classes - Hesse, Immerman (2002) (Correct)
A Switching Lemma for Small Restrictions and Lower.. - Segerlind, Buss.. (2002) (5 citations) (Correct)
Parameterized Circuit Complexity and the W Hierarchy - Downey, Fellows, Regan (1996) (2 citations) (Correct)
Complete Problems for Dynamic Complexity Classes - Hesse, Immerman (2002) (Correct)
Programs Over Semigroups of Dot-Depth One - Alexis Maciel Department (1996) (3 citations) (Correct)
A Tight Relationship between Generic Oracles and Type-2 .. - Cook, Impagliazzo.. (1997) (Correct)
Finite Automata with Generalized Acceptance Criteria - Peichl, Vollmer (2001) (1 citation) (Correct)
Finite Automata with Generalized Acceptance Criteria - Peichl, Vollmer (2001) (1 citation) (Correct)
Computational Politics: Electoral Systems - Hemaspaandra, Hemaspaandra (2000) (3 citations) (Correct)
The Extended Low Hierarchy Is an Infinite Hierarchy - Sheu, Long (1992) (3 citations) (Correct)
A Lower Bound for Perceptrons and an Oracle Separation of the.. - Berg, Ulfberg (1997) (1 citation) (Correct)
On The Power Of Small-Depth Threshold Circuits - Håstad, Goldmann (1991) (13 citations) (Correct)
Characterizing Small Depth and Small Space Classes by.. - Agrawal, Allender, al. (Correct)
On The Power Of Interaction - Aiello, Goldwasser, Hastad (1990) (8 citations) (Correct)
The Descriptive Complexity of the Fixed-Points of Bounded Formulas - Atserias (2000) (Correct)
Almost Optimal Lower Bounds for Small Depth Circuits - Hastad (1989) (99 citations) (Correct)
Deterministic 0L Languages are of Very - Low Complexity Is (Correct)
An Optimal Parallel Algorithm for Formula Evaluation - Buss, Cook, Gupta.. (1990) (28 citations) (Correct)
Complexity Theory - Allender, Loui, Regan (2004) (Correct)
Complexity Classes - Allender, Loui, Regan (Correct)
Fixed-Point Logics, Descriptive Complexity, And Random.. - Atserias (2002) (Correct)
A Switching Lemma for Small Restrictions and Lower.. - Segerlind, Buss.. (2002) (5 citations) (Correct)
A Switching Lemma for Small Restrictions and Lower.. - Segerlind, Buss.. (2002) (5 citations) (Correct)
Characterizing Small Depth and Small Space Classes .. - Agrawal.. (Correct)
Deterministic 0L Languages are of Very Low.. - Damm, Holzer, Lange, .. (Correct)
First 50 documents
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