On the Complexity of n-Player Hackenbush

DOI10.1515/INTEG.2009.049zbMath1182.91051MaRDI QIDQ3400102

Alessandro Cincotti

Publication date: 5 February 2010

Published in: Integers (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/225020

File on IPFS

zbMATH Keywords

complexityHackenbush\(n\)-player games

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) (n)-person games, (n>2) (91A06) Combinatorial games (91A46)

This page was built for publication: On the Complexity of n-Player Hackenbush