The complexity of free-flood-it on \(2\times n\) boards

From MaRDI portal
(Redirected from Publication:388453)
The complexity of free-flood-it on \(2\times n\) boards

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=The_complexity_of_free-flood-it_on_%5C(2%5Ctimes_n%5C)_boards&oldid=61511472"
Powered by MediaWiki