Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Search by expertise, name or affiliation
Approximability of NP-hard problems
Sanjeev Arora
Computer Science
Bendheim Center for Finance
Center for Statistics & Machine Learning
Research output
:
Contribution to journal
›
Conference article
›
peer-review
35
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximability of NP-hard problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Engineering & Materials Science
NP-hard
100%
Approximation algorithms
74%