Amanote Research
Register
Sign In
Relative to a Random Oracle, NP Is Not Small
doi 10.1109/sct.1994.315807
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
S.M. Kautz
P.B. Miltersen
Publisher
IEEE Comput. Soc. Press
Related search
A Short Proof That Np Is Not P
International Journal of Pure and Applied Mathematics
Mathematics
Applied Mathematics
Cook Versus Karp-Levin: Separating Completeness Notions if NP Is Not Small
Theoretical Computer Science
Computer Science
Theoretical Computer Science
A Zero-One Law for RP and Derandomization of AM if NP Is Not Small
Information and Computation
Theoretical Computer Science
Computational Theory
Computer Science Applications
Information Systems
Mathematics
Formal Indistinguishability Extended to the Random Oracle Model
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Relative Density Concept Is Not a Reliable Criterion
Proceedings of the Institution of Civil Engineers: Ground Improvement
Building
Geotechnical Engineering
Soil Science
Engineering Geology
Construction
Mechanics of Materials
Replacing a Random Oracle: Full Domain Hash From Indistinguishability Obfuscation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Relative Complexity of NP Search Problems
Security of Digital Signature Schemes in Weakened Random Oracle Models
