"Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time ..."

Alex D. Scott, Gregory B. Sorkin (2003)

> Home

Details and statistics

DOI: 10.1007/978-3-540-45198-3_32

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/random/ScottS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/random/ScottS03
Alex D. Scott, Gregory B. Sorkin:
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. RANDOM-APPROX 2003: 382-395

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.