Counting Square Tilings with a Fixed Set of Polyominoes Is #EXP-Complete
cs.CC
Submitted: 2026-10-30
Updated: 2026-11-02
Code: https://github.com/canghaimeng/PakFixedPolyomino
Terminology
Sources
- Complexity problems in enumerative combinatorics
- NP-completeness of Tiling Finite Simply Connected Regions with a Fixed Set of Wang Tiles
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?