M. Blum and R. Impagliazzo. Generic oracles and oracle classes (extended abstract). In Proceedings of 28th FOCS, pages 118--126, 1987. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Resource-bounded Continuity and Sequentiality for Type-two.. - Exte Nd Ed (Correct)
NP-Partitions over Posets with an Application to Reducing the Set.. - Kosub (2000) (2 citations) (Correct)
On the Independence of P Versus NP - Ben-David, Halevi (Correct)
Preliminary Report - Stephen Fenner University (Correct)
Inverting the Turing Jump in Complexity Theory - Stephen Fenner Computer (1995) (Correct)
Almost Weakly 2-Generic Sets - Fenner (1996) (Correct)
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once.. - Santha (1991) (6 citations) (Correct)
The P versus NP Problem - Cook (Correct)
Complexity Measures and Decision Tree Complexity: A Survey - Buhrman, de Wolf (2000) (14 citations) (Correct)
On the Power of Quantum Computation - Vazirani (1998) (Correct)
A note on the Isomorphism Conjecture and one-way functions - Rogers (Correct)
The Complexity of Computation on the Parallel Random Access Machine - Fich (1993) (23 citations) (Correct)
Resource-bounded Continuity and Sequentiality for Type-two.. - Buss, al. (Correct)
cs.CC/9904019 - Aug Bounds For (Correct)
On P Versus Np"co-Np For Decision - Trees And Read-Once (Correct)
Nonuniform Hard Boolean Functions and Uniform Complexity Classes - Kabanets (2001) (Correct)
Two Oracles that Force a Big Crunch - Buhrman, Fenner, Fortnow, Torenvliet (Correct)
Efficiently Approximable Real-Valued Functions - Kabanets, Rackoff, Cook (2000) (2 citations) (Correct)
Resource-bounded Continuity and Sequentiality for Type-two.. - Exte Nd Ed (Correct)
On P versus NP∩co-NP for Decision Trees and.. - Jukna, Razborov.. (1997) (Correct)
Uniformly Hard Languages - Rod Downey Victoria (Correct)
Simultaneous Strong Separations of Probabilistic.. - Eppstein.. (1992) (Correct)
Computational Complexity of Learning Read-Once Formulas.. - Hellerstein, Karpinski (1991) (1 citation) (Correct)
A Tight Relationship between Generic Oracles and Type-2 .. - Cook, Impagliazzo.. (1997) Self-citation (Impagliazzo) (Correct)
The Relative Complexity of NP Search Problems - Beame, Cook, Edmonds.. (1997) (20 citations) Self-citation (Impagliazzo) (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