On the complexity of three-player snort played on complete graphs

Target ArticleEdit

On the complexity of three-player snort played on complete graphs; A Cincotti; 2009; doi_citing_unknown

RetractionEdit

Losing games for your winning plays  ; John L Casti; 07/01/2001

doi_cited_unknown

Citation pieceEdit

Note: Open to append information.