1. DSpace at Indian Statistical Institute
  2. Scientific Contributions of ISI
  3. Mathematics and Statistics
Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/6778
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBarua, Rana-
dc.date.accessioned2017-05-30T06:50:41Z-
dc.date.available2017-05-30T06:50:41Z-
dc.date.issued1993-
dc.identifier.citationAmerican Mathematical Society, vol.117, no.1, p.227-233en_US
dc.identifier.urihttp://hdl.handle.net/10263/6778-
dc.language.isoenen_US
dc.subjectMathematical setsen_US
dc.subjectMathematical sequencesen_US
dc.subjectMathematical theoremsen_US
dc.subjectRecursionen_US
dc.subjectIntegersen_US
dc.subjectNatural numbersen_US
dc.titleComplexity of winning strategies for δ0 2 gamesen_US
dc.typeArticleen_US
Appears in Collections:Mathematics and Statistics

Files in This Item:
File Description SizeFormat 
Complexity of Winning Strategies for Games.pdf241.17 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.