Abstract
We present a general technique for proving NP-hardness (under randomized polynomial time reductions) of string folding problems over a finite alphabet. All previous such intractability results have...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have