search result

Cover von An Optimal Algorithm for Online Freeze-Tag

An Optimal Algorithm for Online Freeze-Tag

Year: 2020
Media group: LIPIcs
Cover von Tetris Is Hard with Just One Piece Type

Tetris Is Hard with Just One Piece Type

Year: 2026
Media group: LIPIcs
Cover von Easier Ways to Prove Counting Hard

Easier Ways to Prove Counting Hard

A Dichotomy for Generalized #SAT, Applied to Constraint Graphs
Author: Hecher, Markus; Stock, Frederick; Zhou, Zixiang
Year: 2024
Media group: LIPIcs
Cover von Complexity of Retrograde and Helpmate Chess Problems

Complexity of Retrograde and Helpmate Chess Problems

Even Cooperative Chess Is Hard
Year: 2020
Media group: LIPIcs
Cover von Arithmetic Expression Construction

Arithmetic Expression Construction

Author: Alcock, Leo; Asif, Sualeh; Demaine, Erik D.
Year: 2020
Media group: LIPIcs
Cover von Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints

Author: Gregg, Christine; Hendrickson, Della H.; Kostitsyna, Irina
Year: 2024
Media group: LIPIcs
Cover von ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles

Author: Tockman, Andy
Year: 2024
Media group: LIPIcs
Cover von 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete

1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete

Author: Suhl, Adam; Zeff, Avi
Year: 2020
Media group: LIPIcs
OPEN V 11.1.0.0