Loading...
The system can't perform the operation now. Try again later.
Articles
Case law
Profiles
My profile
My library
Metrics
Alerts
Settings
Get journal articles
Get journal articles
Profiles
My profile
My library
Muli Safra
Professor of Computer Science, Tel Aviv University
Cited by 10500
NP-hard
Boolean functions
hardness
random graphs
probabilistically checkable proofs
Amey Bhangale
University of California, Riverside
Verified email at cs.ucr.edu
Cited by 259
Hardness of approximation
approximation algorithms
probabilistically checkable proofs
Privacy
Terms
Help
About Scholar
Search help