8 citations · 24 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017★ 5 cited
Hard and Easy Instances of L-Tromino Tilings
Javier T. Akagi, Carlos F. Gaona, Fabricio Mendoza +2
We study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, no…
cs.CC2017
A Block-Sensitivity Lower Bound for Quantum Testing Hamming Distance
Marcos Villagra
The Gap-Hamming distance problem is the promise problem of deciding if the Hamming distance between two strings of length is greater than or less than , where the ga…