Tetris is Hard, Even to Approximate

Tetris is Hard, Even to Approximate

Bibliographic Details
Main Authors:	Demaine, Erik D., Hohenberger, Susan, Liben-Nowell, David
Published:	2023
Online Access:	https://hdl.handle.net/1721.1/149961

Similar Items

Tetris is NP-hard even with O (1) Rows or Columns
by: Asif, Sualeh, et al.
Published: (2022)

Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,...
by: Demaine, Erik D, et al.
Published: (2020)

Dissection with the Fewest Pieces is Hard, Even to Approximate
by: Manurangsi, Pasin, et al.
Published: (2018)

UNO is hard, even for a single player
by: Demaine, Erik D., et al.
Published: (2011)

Projected equation and aggregation-based approximate dynamic programming methods for Tetris
by: Hwang, Daw-sen
Published: (2011)

Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard
by: Bosboom, Jeffrey William, et al.
Published: (2019)

Complexity of retrograde and helpmate chess problems: Even cooperative chess is hard
by: Brunner, J, et al.
Published: (2022)

Walking through doors is hard, even without staircases: Proving PSPACE-hardness via planar assemblies of door gadgets
by: Ani, Joshua, et al.
Published: (2020)

Models of common errors in a Tetris session
by: Chang, Alice Ai-Yuan.
Published: (2020)

Kaboozle Is NP-complete, even in a Strip
by: Asano, Tetsuo, et al.
Published: (2011)

Tetris-inspired detector with neural network for radiation mapping
by: Ryotaro Okabe, et al.
Published: (2024-04-01)

Existence and hardness of conveyor belts
by: Demaine, Erik D, et al.
Published: (2020)

Tetris Genioplasty: A New Paradigm for Chin Asymmetries Correction
by: Valerio Ramieri, et al.
Published: (2023-11-01)

Urbanization Chaos of Suburban Small Cities in Poland: ‘Tetris Development’
by: Anna Majewska, et al.
Published: (2020-11-01)

Finding Longest Increasing and Common Subsequences in Streaming Data
by: Liben-Nowell, David, et al.
Published: (2005)

Molecular Tetris by sequence-specific stacking of hydrogen bonding molecular clips
by: Hyun Lee, et al.
Published: (2022-12-01)

An algorithmic approach to social networks
by: Liben-Nowell, David
Published: (2006)

Rigid foldability is NP-hard
by: Demaine, Erik D, et al.
Published: (2020)

TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit Ansätze
by: Panagiotis G. Anastasiou, et al.
Published: (2024-03-01)

Approximability of the Subset Sum Reconfiguration Problem
by: Ito, Takehiro, et al.
Published: (2014)

Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect
by: Demaine, Erik D
Published: (2020)

Playing Dominoes Is Hard, Except by Yourself
by: Demaine, Erik D., et al.
Published: (2015)

PSYCHOTHERAPEUTIC TOOLS IN DEALING WITH NEGATIVE PSYCHOEMOTIONAL STATES BY EXAMPLE OF ONLINE GAMES "TETRIS" AND "FARM"
by: Olga V. Puchyna, et al.
Published: (2023-11-01)

Penerapan Unsur Budaya Indonesia pada Aplikasi Game Tetris Nusantara Berbasis Android
by: Albertus Agung, et al.
Published: (2014-12-01)

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs
by: Demaine, Erik D, et al.
Published: (2019)

Even Simple Processes of π-calculus are Hard for Analysis
by: Marat M. Abbas, et al.
Published: (2018-12-01)

Solution of the Percus-Yevick equation for hard hyperspheres in even dimensions.
by: Adda-Bedia, M, et al.
Published: (2008)

A simple proof that the (n2 − 1)-puzzle is hard
by: Demaine, Erik D, et al.
Published: (2022)

A simple proof that the (n2 − 1)-puzzle is hard
by: Demaine, Erik D, et al.
Published: (2021)

Symmetric assembly puzzles are hard, beyond a few pieces
by: Demaine, Erik D, et al.
Published: (2020)

Flattening fixed-angle chains is strongly NP-hard
by: Demaine, Erik D., et al.
Published: (2012)

Exploring the use of Tetris as a post-trauma ‘cognitive vaccine’: from memory consolidation to reconsolidation
by: James, E
Published: (2013)

Tetris-Style Stacking Process to Tailor the Orientation of Carbon Fiber Scaffolds for Efficient Heat Dissipation
by: Shida Han, et al.
Published: (2023-06-01)

Mario Kart Is Hard
by: Waingarten, Erik, et al.
Published: (2017)

O(1)-approximations for maximum movement problems
by: Berman, Piotr, et al.
Published: (2012)

Approximation Algorithms via Contraction Decomposition
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2011)

Tree-residue vertex-breaking: A new tool for proving hardness
by: Demaine, Erik, et al.
Published: (2021)

Minimal Reachability is Hard to Approximate
by: Jadbabaie, A, et al.
Published: (2023)

Push-Pull Block Puzzles are Hard
by: Demaine, Erik D, et al.
Published: (2019)

Circle Packing for Origami Design Is Hard
by: Demaine, Erik D, et al.
Published: (2019)