Back to Results
First PageMeta Content
Complexity classes / Probabilistic complexity theory / Mathematical optimization / NP-complete problems / Probabilistically checkable proof / NP / PCP theorem / P versus NP problem / MAX-3SAT / Theoretical computer science / Computational complexity theory / Applied mathematics


Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010
Add to Reading List

Document Date: 2013-04-24 07:33:09


Open Document

File Size: 334,24 KB

Share Result on Facebook

City

Hyderabad / /

Company

Efficient Proof Systems / CNF / /

Country

Israel / India / /

/

Facility

Weizmann Institute of Science Rehovot / /

IndustryTerm

r-approximation algorithm / search problem clique / valid solution / approximate solution / machinery / randomized local algorithm / polynomial-time algorithm / search problem / given solution / proof systems / correct solution / approximate solutions / mathematical systems / Approximation algorithms / search problems / /

Organization

NP / International Congress / Weizmann Institute of Science Rehovot / /

Position

author / /

Technology

cryptography / randomized local algorithm / polynomial-time algorithm / Approximation algorithms / r-approximation algorithm / /

SocialTag