Back to Results
First PageMeta Content
NP-complete problems / Vertex cover / Independent set / NP-complete / NP / PCP theorem / Maximal independent set / Power set / P versus NP problem / Theoretical computer science / Mathematics / Computational complexity theory


Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra*
Add to Reading List

Document Date: 2006-04-11 06:21:40

Open Document

File Size: 999,08 KB

Share Result on Facebook

Company

Zn2 / Vertex / /

IndustryTerm

efficient algorithm / polynomial-time solution / efficient approximation algorithms / plausible solutions / lattice basis reduction algorithm / inner def product / approximate solution / inner-product / set-systems / /

Organization

Fund for Basic Research / Israel Academy of Sciences / /

Person

Irit Dinur / Samuel Safra / Ai / /

ProgrammingLanguage

C / /

PublishedMedium

Annals of Mathematics / /

Technology

efficient algorithm / nding efficient approximation algorithms / lattice basis reduction algorithm / /

SocialTag