5 citations · 12 across the 7 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016
Even Edge-Matching and Jigsaw Puzzles are Really Hard
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine +3
We prove the computational intractability of rotating and placing square tiles into a array such that adjacent tiles are compatible--either equal edge colors, as i…
cs.DS2016★ 5 cited
Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation
Maryam Aliakbarpour, Amartya Shankha Biswas, Themistoklis Gouleakis +3
We study the problem of estimating the value of sums of the form when one has the ability to sample with probability proportional…