"On the Complexity of Succinct Zero-Sum Games."

Lance Fortnow et al. (2008)

> Home

Details and statistics

DOI: 10.1007/S00037-008-0252-2

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/FortnowIKU08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/FortnowIKU08
Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans:
On the Complexity of Succinct Zero-Sum Games. Comput. Complex. 17(3): 353-376 (2008)

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.