default search action

combined dblp search
author search
venue search
publication search

ask others

"Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation ..."

Venkatesan Guruswami et al. (2011)

> Home

Details and statistics

DOI: 10.1137/090756144

access: closed

type: Journal Article

metadata version: 2023-11-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/GuruswamiHMRC11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/GuruswamiHMRC11
Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar:
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant. SIAM J. Comput. 40(3): 878-914 (2011)

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.