Jeffrey Bosboom

MaRDI QIDQ2196561zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The Legend of Zelda: the complexity of mechanics (available as arXiv preprint)	2024-04-09	Paper
The Legend of Zelda: the complexity of mechanics	2024-04-09	Paper
Arithmetic Expression Construction. (available as arXiv preprint)	2023-11-14	Paper
Tatamibari is NP-complete	2023-02-07	Paper
Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets	2023-02-07	Paper
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Theoretical Computer Science	2020-09-03	Paper
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (available as arXiv preprint)	2020-08-11	Paper
Computational complexity of generalized Push Fight (available as arXiv preprint)	2020-08-11	Paper
Path puzzles: discrete tomography with a path constraint is hard Graphs and Combinatorics	2020-04-03	Paper
Mario Kart is hard Lecture Notes in Computer Science	2017-02-01	Paper
Dissection with the fewest pieces is hard, even to approximate Lecture Notes in Computer Science	2017-02-01	Paper

Research outcomes over time

This page was built for person: Jeffrey Bosboom