Back to Results
First PageMeta Content
Complexity classes / Probabilistic complexity theory / Quantum complexity theory / Analysis of algorithms / Randomized algorithm / PP / NP / P / Theoretical computer science / Computational complexity theory / Applied mathematics


Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy
Add to Reading List

Document Date: 2014-06-22 06:24:53

Open Document

File Size: 256,00 KB

Share Result on Facebook

City

La Jolla / Rehovot / /

Country

Israel / United States / /

Currency

pence / /

/

Facility

Weizmann Institute of Science / University of California / /

IndustryTerm

oracle algorithm / deterministic algorithm / probabilistic algorithm / polynomialStime algorithm / probabilistic algorithms / interactive proof systems / polynomial time oracle algorithm / /

Organization

National Science Foundation / Department of Computer Science and Applied Mathematics / MIT / University of California at San Diego / Weizmann Institute of Science / /

/

Product

CCR / /

ProvinceOrState

California / /

Technology

deterministic algorithm / oracle algorithm / polynomial time oracle algorithm / 3g / probabilistic algorithm / polynomialStime algorithm / 1 An algorithm / /

URL

http /

SocialTag