Reflections on Handling P vs NP Problem Submissions in Academic Journals
By
luu
Pure flour-power. Hearty enough to carry you through lunch.
Summary
Eric Allender reflects on his experience as Editor-in-Chief of ACM Transactions on Computation Theory, particularly the challenges of handling submissions claiming to resolve the P vs NP problem. He discusses the difficulties in finding referees for such papers and the overhead involved in managing frequent submissions. The post was prompted by an incorrect P ≠ NP proof published in Springer Nature's Frontiers of Computer Science.
Key quotes
· 3 pulledFor a time, I served as Editor-in-Chief of ACM Transactions on Computation Theory, and in this role I had to deal regularly with submissions that claimed to resolve the P vs NP problem.
Finding referees for these papers was sometimes challenging, so I frequently ended up reviewing them myself.
Dealing with such submissions involves enough overhead that ToCT, J.ACM and ACM Transactions on Algorithms limit the frequency with which authors can submit work.
You might also wanna read
AI and Publish-or-Perish Culture Are Overwhelming Academic Peer Review, Study Finds
This article, authored by the AI Task Force for Organization Science, examines how generative AI is reshaping academic peer review and resea
CERN Selected to Host Open Research Europe Platform for Diamond Open Access Publishing
CERN has been selected to host the next phase of Open Research Europe (ORE), a European Commission-supported open access publishing platform
home.cern·2mo ago
ICML Addresses AI Challenges to Peer Review Integrity and LLM Policy Violations
The article discusses the challenges AI poses to peer review integrity in academic conferences, specifically focusing on ICML's efforts to a
blog.icml.cc·2mo ago
Corrected arXiv Submission Data Shows Steady Growth, Not Dramatic Surge in High-Energy Physics Papers
The article presents corrected arXiv preprint submission data showing that while there are year-over-year increases in submissions to the he
Exploring Computational Complexity: A Ruliological Approach to the P vs. NP Problem
The article explores computational complexity theory and the P vs. NP problem through a 'ruliological' approach, examining why fundamental q
writings.stephenwolfram.com·4mo ago
Flawed Management Science Study on Sustainability and Stock Returns Continues to Be Cited Despite Evidence of Problems
The article discusses a landmark study in Management Science that has been cited over 6,000 times and referenced by Wall Street executives,