Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/6778| Title: | Complexity of winning strategies for δ0 2 games |
| Authors: | Barua, Rana |
| Keywords: | Mathematical sets Mathematical sequences Mathematical theorems Recursion Integers Natural numbers |
| Issue Date: | 1993 |
| Citation: | American Mathematical Society, vol.117, no.1, p.227-233 |
| URI: | http://hdl.handle.net/10263/6778 |
| Appears in Collections: | Mathematics and Statistics |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Complexity of Winning Strategies for Games.pdf | 241.17 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.