Jeffrey Bosboom

From MaRDI portal
Person:2196561

Available identifiers

zbMath Open bosboom.jeffreyMaRDI QIDQ2196561

List of research outcomes





PublicationDate of PublicationType
The Legend of Zelda: the complexity of mechanics2024-04-09Paper
Arithmetic Expression Construction.2023-11-14Paper
Tatamibari is NP-complete2023-02-07Paper
Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets2023-02-07Paper
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible2020-09-03Paper
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible2020-08-11Paper
Computational complexity of generalized Push Fight2020-08-11Paper
Path puzzles: discrete tomography with a path constraint is hard2020-04-03Paper
Mario Kart is hard2017-02-01Paper
Dissection with the fewest pieces is hard, even to approximate2017-02-01Paper

Research outcomes over time

This page was built for person: Jeffrey Bosboom

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2196561&oldid=7662051"
Powered by MediaWiki