"On the parameterized complexity of finding short winning strategies in ..."

Allan E. Scott (2009)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2022-08-05

- view
  - electronic edition via handle.net
- export record
  dblp key:
  - phd/ca/Scott09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/ca/Scott09
Allan E. Scott:
On the parameterized complexity of finding short winning strategies in combinatorial games. University of Victoria, Canada, 2009

a service of

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.