No. Title Author Year
1 Arithmetic Expression Construction Alcock, Leo et al. 2020
2 Tatamibari Is NP-Complete Adler, Aviv et al. 2020
3 Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets Ani, Joshua et al. 2020
4 Computational Complexity of Generalized Push Fight Bosboom, Jeffrey et al. 2018
5 Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Abel, Zachary et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 5

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI