"The Projection Games Conjecture and the NP-Hardness of ln n-Approximating ..."

Dana Moshkovitz (2015)

> Home

Details and statistics

DOI: 10.4086/TOC.2015.V011A007

access: open

type: Journal Article

metadata version: 2020-06-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/toc/Moshkovitz15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/Moshkovitz15
Dana Moshkovitz:
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover. Theory Comput. 11: 221-235 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.