Back to Results
First PageMeta Content
Complexity classes / Structural complexity theory / Mathematical optimization / Probabilistic complexity theory / NP / P versus NP problem / P / Bounded-error probabilistic polynomial / Interactive proof system / Theoretical computer science / Computational complexity theory / Applied mathematics


Computational Complexity Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. [removed]
Add to Reading List

Document Date: 2014-06-22 06:25:18

Open Document

File Size: 261,86 KB

Share Result on Facebook

Company

S 2 coRP . / /

Country

Israel / /

Currency

IDR / Rs / /

/

Facility

Computer Science Weizmann Institute of Science Rehovot / /

IndustryTerm

polynomial-time algorithm / search problem / given solution / search version / proof systems / interactive proof systems / valid solution / successive applications / search problems / ctitious computing device / /

Organization

RP BPP / Computational Complexity Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot / /

Position

author / /

Product

RPG / /

Technology

3g / polynomial-time algorithm / /

SocialTag