Muli Safra

Muli Safra

Professor of Computer Science, Tel Aviv University
Cited by 10500
NP-hard Boolean functions hardness random graphs probabilistically checkable proofs
Amey Bhangale

Amey Bhangale

University of California, Riverside
Verified email at cs.ucr.edu
Cited by 259
Hardness of approximation approximation algorithms probabilistically checkable proofs