OpenAlex
PricingAboutJobs
Log inGet started
Work

Approximation and Hardness: Beyond P and NP

HTML

Year: 2019
Type: report
Source: UC Berkeley
Author: Pasin Manurangsi
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: hardness of approximation, densest k-subgraph, VC dimension, k-dominating sets, k-clique, closest pair, parameterized complexity, quasi-polynomial time, combinatorial optimization

Open Access status: closed
OpenAlex ID: W2975522469
Cites:
Cited by: 7
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security