"Approximating the Minmax Value of Three-Player Games within a Constant is ..."

Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-33996-7_9

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sagt/EickmeyerHV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sagt/EickmeyerHV12
Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin:
Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques. SAGT 2012: 96-107

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.