Back to Results
First PageMeta Content
Complexity classes / Mathematical proofs / Probabilistic complexity theory / Mathematical optimization / Interactive proof system / NP / Probabilistically checkable proof / IP / P versus NP problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2003-04-15 15:57:54

Open Document

File Size: 2,09 MB

Share Result on Facebook

City

Rehovot / Cambridge / Tel-Aviv / New Haven / /

Company

CNF / Szegedy / AT&T Bell Laboratories / MARIO SZEGEDY AT& T Bell Laboratories / /

Country

Israel / /

Currency

pence / USD / /

/

Event

Person Travel / FDA Phase / Person Communication and Meetings / /

Facility

Princeton University / Massachusetts LOVASZ Yale University / Israel SHAFI GOLDWASSER Massachusetts LASZLO Institute of Technology / Technology Square / Massachusetts Institute of Technology / Tel-Aviv University / Weizmann Institute / Yale University / /

IndustryTerm

multi-prover protocol / multi-prover interactive protocol / good approximation algorithm / polynomial time algorithm / interactive proof systems / graph products / multi-prover interactive proof systems / graph product / approximation algorithms / /

Organization

Department of Applied Math and Computer Science / Weizmann Institute / Department of Computer Science / Institute of Technology / Princeton University / Department of Electrical Engineering and Computer Science / Yale University / Tel-Aviv University / Tel-Aviv / Association for Computing Machinery / /

Person

Murray Hill / SHAFI GOLDWASSER / Carey / MAX CLIQUE / Johnson / MAX NP / URIEL FEIGE / SHMUEL SAFRA / /

Position

VP / Theory General / /

Product

NTA14E / Babai / /

ProgrammingLanguage

L / /

ProvinceOrState

New Jersey / Massachusetts / Connecticut / /

Technology

269 Nonnumerical Algorithms / polynomial time algorithm / good approximation algorithm / multi-prover interactive protocol / approximation algorithms / SNP / multi-prover protocol / 545 Technology / /

SocialTag