Skip to main content
Avi Wigderson
Personal
Short Bio
CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
Are Search and Decision Problems Computationally Equivalent?
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
R. Karp
E. Upfal
A. Wigderson
Publication:
Proceedings of the 17th STOC, pp. 464-475, May 1985.
Year:
1985
Abstract:
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/kuw85.pdf
Hide
Files
File:
Proceedings version (pdf)
Proceedings version (ps)
bibTeX
‹ An Analysis of a Simple Genetic Algorithm
up
BPP has Subexponential Time Simulations unless EXPTIME has Publishable Proofs ›