2 citations · 3 across the 6 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012★ 2 cited
Unshuffling a Square is NP-Hard
Sam Buss, Michael Soltys
A shuffle of two strings is formed by interleaving the characters into a new string, keeping the characters of each string in order. A string is a square if it is a shuffle of two…
cs.LO2012★ 1 cited
Improved Separations of Regular Resolution from Clause Learning Proof Systems
Maria Luisa Bonet, Sam Buss, Jan Johannsen
We prove that the graph tautology formulas of Alekhnovich, Johannsen, Pitassi, and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned c…