29 citations · 35 across the 10 of their papers we have counts for
Showing cs.CCShow 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.CC2008
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Grzegorz Herman, Michael Soltys
Although a deterministic polytime algorithm for primality testing is now known, the Rabin-Miller randomized test of primality continues being the most efficient and widely used alg…