"Hardness of Finding Independent Sets in Almost 3-Colorable Graphs."

Irit Dinur et al. (2010)

> Home

Details and statistics

DOI: 10.1109/FOCS.2010.84

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  authority control:
- export record
  dblp key:
  - conf/focs/DinurKPS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/DinurKPS10
Irit Dinur, Subhash Khot, Will Perkins, Muli Safra:
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. FOCS 2010: 212-221

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.