Richard M. Karp and Richard J. Lipton. Some Connections Between Nonuniform and Uniform Complexity Classes. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pages 302--309, 1980. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Rice-Style Theorems for Complexity Theory - Hemaspaandra, Thakur (2001) (Correct)
Random Access to Advice Strings - And Collapsing Results (Correct)
SIGACT News Complexity Theory Column 6 - Dept Of Computer (Correct)
Links Between Complexity Theory and Constrained Block Coding - Stockmeyer, Modha (2002) (Correct)
Distance-based merging: A general framework and some.. - Konieczny, Lang, Marquis (2001) (1 citation) (Correct)
Oracles and Queries that are Sufficient for Exact.. - Bshouty, Cleve.. (1996) (51 citations) (Correct)
Super-Polynomial versus Half-Exponential Circuit Size.. - Miltersen, Variyam.. (1999) (3 citations) (Correct)
Decoding of Reed Solomon codes beyond the error-correction bound - Sudan (1997) (83 citations) (Correct)
A Knowledge Compilation Map - Darwiche, Marquis (2002) (2 citations) (Correct)
The Hardness of the Closest Vector Problem with Preprocessing - Micciancio (2001) (4 citations) (Correct)
A Perspective on Knowledge Compilation - Darwiche, Marquis (2001) (4 citations) (Correct)
Threshold Computation and Cryptographic Security - Han, Hemaspaandra, Thierauf (1995) (5 citations) (Correct)
... - Cai (Correct)
Maximum Likelihood Decoding of Reed Solomon Codes - Sudan (1996) (6 citations) (Correct)
A View of Structural Complexity Theory - Book, WATANABE (Correct)
On Helping and Interactive Proof Systems - Arvind, Köbler, Schuler (1995) (2 citations) (Correct)
Graph Isomorphism is Low for ZPP(NP) and other Lowness results - Arvind, Köbler (2000) (4 citations) (Correct)
Preprocessing of Intractable Problems - Cadoli, Donini, Liberatore, Schaerf (2000) (1 citation) (Correct)
On the Compilability of Diagnosis, Planning, Reasoning about.. - Liberatore (Correct)
The Turing Machine Paradigm in Contemporary Computing - van Leeuwen, Wiedermann (2000) (2 citations) (Correct)
Compilability of Abduction - Liberatore, Schaerf (2000) (Correct)
Super-Polynomial versus Half-Exponential Circuit.. - Miltersen.. (1999) (3 citations) (Correct)
Upper bounds for the Complexity of Sparse and Tally.. - Arvind, Köbler, Mundhenk (1996) (7 citations) (Correct)
New Collapse Consequences Of NP Having Small Circuits - Köbler, Watanabe (1998) (Correct)
Super-Polynomial versus Half-Exponential Circuit.. - Miltersen.. (1999) (3 citations) (Correct)
Graph Isomorphism is Low for ZPP(NP) and other Lowness results - Arvind, Köbler (1999) (4 citations) (Correct)
Space Efficiency of Propositional Knowledge Representation.. - Cadoli, al. (2000) (3 citations) (Correct)
On Sparse Hard Sets for Counting Classes - Ogiwara, Lozano (1993) (9 citations) (Correct)
Relating Equivalence And Reducibility To Sparse Sets - Allender, Hemaspaandra, al. (1992) (20 citations) (Correct)
Reductions to Sets of Low Information Content.. - Arvind, Han.. (Correct)
Preprocessing of Intractable Problems - Cadoli, Donini, Liberatore, Schaerf (1999) (1 citation) (Correct)
Bounded Truth-Table and Conjunctive Reductions to Sparse .. - Arvind, Köbler, Mundhenk (1992) (2 citations) (Correct)
Oracles and Queries that are Sufficient for - Exact Learning Nader (Correct)
Research Reports on - Mathematical And Computing (Correct)
Observations on Measure and Lowness for Δ_2^p - Lutz (Correct)
Almost Everywhere High Nonuniform Complexity - Lutz (1992) (99 citations) (Correct)
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin .. - Gutfreund, Shaltiel, al. (Correct)
Derandomization That is Rarely Wrong From Short Advice.. - Goldreich, Wigderson (2002) (Correct)
Unknown - Tr Electronic Colloquium (1997) (Correct)
Knowledge compilation = Query rewriting + View synthesis - Cadoli, Mancini (Correct)
Lecture Notes on Computational Complexity - Trevisan (2004) (Correct)
Complete Sets and Structure in Subrecursive Classes - Buhrman, Torenvliet (1998) (7 citations) (Correct)
Algebraic Properties for Deterministic Selectivity - Hemaspaandra, Hempel (2001) (Correct)
The Boolean Hierarchy of NP-Partitions - Kosub, Wagner (2000) (3 citations) (Correct)
Lower Bounds and the Hardness of Counting Properties - Hemaspaandra, Thakur (2002) (Correct)
Complicated Complementations - Harry Buhrman Cwi (Correct)
Optimal Advice - Lane Hemaspaandra Department (1994) (1 citation) (Correct)
On Pseudorandomness and Resource-Bounded Measure - Arvind Institute Of (1997) (9 citations) (Correct)
New Lowness Results for ZPP^NP and other Complexity Classes - Arvind, Köbler (Correct)
On Polynomial-Time Bounded Truth-Table Reducibility of NP.. - Ogiwara, Watanabe (1991) (42 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