Back to Results
First PageMeta Content
NP-complete problems / Graph coloring / Clique / Graph operations / Independent set / Clique problem / Line graph / Graph theory / Theoretical computer science / Mathematics


Derandomized Graph Products Noga Alon ∗ Uriel Feige†
Add to Reading List

Document Date: 2002-02-21 20:23:30

Open Document

File Size: 195,65 KB

Share Result on Facebook

City

Rehovot / Cambridge / Jerusalem / /

Company

IBM / AT & T / G. / T Bell Labs / /

Country

United States / Israel / /

/

Facility

Tel Aviv University / Hebrew University of Jerusalem / IBM T.J. Watson Research Center / Technology Square / Weizmann Institute / /

Holiday

Assumption / /

IndustryTerm

log c2 polynomial time algorithm / graph theoretic tool / polynomial time algorithm / interactive proof systems / greedy algorithm / randomized graph products / name randomized graph products / scalar product / basic graph theoretic tool / k-fold graph product / graph products / graph product / approximation algorithms / /

NaturalFeature

Yorktown Heights / /

Organization

National Science Foundation / Weizmann Institute / Department of Computer Science / Department of Applied Math / Department of Mathematics / MIT Lab for Computer Science / Hebrew University of Jerusalem / Beverly Sackler Faculty of Exact Sciences / Tel Aviv University / Tel Aviv / /

Person

David Zuckerman / Raymond Sackler / Murray Hill / Beverly Sackler / Uriel Feige† Avi Wigderson / /

/

Position

Prime Minister / /

ProvinceOrState

Massachusetts / /

Technology

polynomial time algorithm / greedy algorithm / approximation algorithms / 3 Algorithm / SNP / 545 Technology / log c2 polynomial time algorithm / /

SocialTag