Complexities of winning strategies in diophantine games (Q1908042)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexities of winning strategies in diophantine games |
scientific article; zbMATH DE number 850550
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexities of winning strategies in diophantine games |
scientific article; zbMATH DE number 850550 |
Statements
Complexities of winning strategies in diophantine games (English)
0 references
2 September 1996
0 references
computing winning strategies in diophantine games
0 references
polynomial time computable winning strategy
0 references
