It is tough to be a plumber
Under an Elsevier user license
open archive
Keywords
Combinatorial game theory
NP-completeness
Cited by (0)
- 1
Institute for Theoretical Computer Science is supported as project LN00A056 by Ministry of Education of the Czech Republic.
- 2
The author acknowledges support by GA CR Grant No. 201/98/1451.
- 3
The authors acknowledge support by Grant 201/01/1195 of GA ČR, and cooperative research Grant KONTAKT-ME476/CCR-9988360-001 from the NSF and MŠMT ČR.
Copyright © 2003 Elsevier B.V. All rights reserved.