Muli Safra

Muli Safra

Professor of Computer Science, Tel Aviv University
Citado por 10613
NP-hard Boolean functions hardness random graphs probabilistically checkable proofs
Amey Bhangale

Amey Bhangale

University of California, Riverside
E-mail confirmado em cs.ucr.edu
Citado por 264
Hardness of approximation approximation algorithms probabilistically checkable proofs