Revisions to Is it appropriate to post question asking to prove NP-completness of more than one problem?

replaced http://mathoverflow.net/ with https://mathoverflow.net/

Source Link

edited Apr 13, 2017 at 12:58

1

I believe that I discovered a method to generate several NP-complete problems. The NP-completeness proof is not immediately apparent to me. I did not find any reference in complexity literature to my problems and their $NP$-completeness. Such problems include the following posts:

How hard is reconstructing a permutation from its differences sequence?How hard is reconstructing a permutation from its differences sequence?

Recognizing sequences sortable by transpositions?

Is it fine to post question asking for proofs of $NP$-completeness of several problems?

replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/

Source Link

edited Apr 13, 2017 at 12:32

Community Bot

1

I believe that I discovered a method to generate several NP-complete problems. The NP-completeness proof is not immediately apparent to me. I did not find any reference in complexity literature to my problems and their $NP$-completeness. Such problems include the following posts:

How hard is reconstructing a permutation from its differences sequence?

Recognizing sequences sortable by transpositions?Recognizing sequences sortable by transpositions?