*Theory of Computing* frequently receives submissions purporting to
solve a long-standing open problem in complexity theory, such as the
P/NP problem ("P/NP manuscripts/submissions," for short).
P/NP submissions tax the voluntary
editorial and peer-reviewing resources used by *Theory of Computing*
by requiring the review process to identify errors in them.
*Theory of Computing* remains open to the possibility
of eventual resolution of P/NP and related questions, and continues to
welcome submissions on the subject. However, to mitigate the burden of
repeated submissions of incremental corrections of errors identified
during editorial review, *Theory of Computing* has adopted the
following policy:

- Along with any P/NP submission, the author(s)
must disclose to the Editors of
*Theory of Computing*the submission/review history of all P/NP manuscripts by the same author(s), and the author(s) must share any reviews of such submissions with the Editors. This includes previous versions of the current submission as well as other P/NP manuscripts by the same author(s). - No author may submit more than one P/NP manuscript to
*Theory of Computing*in any 36 month period, except by invitation of the Editor-in-Chief. This applies to revisions of previously rejected manuscripts.