Computing L-Polynomials of Picard curves from Cartier-Manin matrices
Get full text
Paper
Journal Article
PSPACE-completeness of Pulling Blocks to Reach a Goal
Hayashi Ani, Sualeh Asif, Demaine, Erik D, Diomidova, Jenny, Hendrickson, Dylan, Lynch, Jayson, Scheffler, Sarah, Suhl, Adam
Published in arXiv.org (25.02.2022)
Published in arXiv.org (25.02.2022)
Get full text
Paper
Journal Article
Tetris is NP-hard even with O(1) Rows or Columns
Asif, Sualeh, Coulombe, Michael, Demaine, Erik D., Demaine, Martin L., Hesterberg, Adam, Lynch, Jayson, Singhal, Mihir
Published in Journal of Information Processing (2020)
Published in Journal of Information Processing (2020)
Get full text
Journal Article
Tetris is NP-hard even with $O(1)$ rows or columns
Asif, Sualeh, Coulombe, Michael, Demaine, Erik D, Demaine, Martin L, Hesterberg, Adam, Lynch, Jayson, Singhal, Mihir
Year of Publication 29.09.2020
Year of Publication 29.09.2020
Get full text
Journal Article
Arithmetic Expression Construction
Alcock, Leo, Asif, Sualeh, Bosboom, Jeffrey, Brunner, Josh, Chen, Charlotte, Demaine, Erik D, Epstein, Rogers, Hesterberg, Adam, Hirschfeld, Lior, Hu, William, Lynch, Jayson, Scheffler, Sarah, Zhang, Lillian
Year of Publication 23.11.2020
Year of Publication 23.11.2020
Get full text
Journal Article
Tetris is NP-hard even with \(O(1)\) rows or columns
Sualeh Asif, Coulombe, Michael, Demaine, Erik D, Demaine, Martin L, Hesterberg, Adam, Lynch, Jayson, Singhal, Mihir
Published in arXiv.org (29.09.2020)
Get full text
Published in arXiv.org (29.09.2020)
Paper