Computational Complexity of Tetris Clearing with Restricted Piece Types

Tetris clearing is NP-hard and #P-hard even when the piece types are restricted to any size-2 subset of the seven Tetris piece types. The results also hold under the "hard drops only" and "20G" models for certain piece type subsets.