most citedConditional Complexity Hardness: Monotone Circuit Size, Matrix Rigidity, and Tensor Rank

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2026

The Greedy Superstring Algorithm Achieves Ratio 2 for Strings of Length 6 Already

Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin +1

In the Shortest Common Superstring (SCS) problem, one is given a set of strings and is asked to find a string of minimum length containing each of the input strings as a substring.…