{"id":19405832,"url":"https://github.com/michaelwehar/p-vs-np-community","last_synced_at":"2026-03-19T09:43:47.121Z","repository":{"id":47373455,"uuid":"155639889","full_name":"MichaelWehar/P-vs-NP-Community","owner":"MichaelWehar","description":"This repository was setup to help people who believe that they solved the P vs NP problem and to help the people who review proposed solutions.","archived":false,"fork":false,"pushed_at":"2022-10-24T03:01:12.000Z","size":21,"stargazers_count":5,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-07T13:23:30.406Z","etag":null,"topics":["complexity-theory","computational-complexity","millennium-problems","non-determinism","p-vs-np","polynomial-time","unsolved-problems"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/MichaelWehar.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2018-11-01T00:25:44.000Z","updated_at":"2024-12-25T03:51:09.000Z","dependencies_parsed_at":"2023-01-20T08:18:48.449Z","dependency_job_id":null,"html_url":"https://github.com/MichaelWehar/P-vs-NP-Community","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MichaelWehar%2FP-vs-NP-Community","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MichaelWehar%2FP-vs-NP-Community/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MichaelWehar%2FP-vs-NP-Community/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MichaelWehar%2FP-vs-NP-Community/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MichaelWehar","download_url":"https://codeload.github.com/MichaelWehar/P-vs-NP-Community/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240582044,"owners_count":19824145,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["complexity-theory","computational-complexity","millennium-problems","non-determinism","p-vs-np","polynomial-time","unsolved-problems"],"created_at":"2024-11-10T11:39:42.940Z","updated_at":"2026-03-03T05:34:46.025Z","avatar_url":"https://github.com/MichaelWehar.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# What to do if you have a proposed solution to P vs NP? \n\n*Do you have a proposed P vs NP solution?  Did someone send you a proposed P vs NP solution and ask you to review it?*\n\nThis repository was setup to help people who believe that they solved the P vs NP problem and to help the people who review proposed solutions.\n\n### P vs NP is a popular problem that has captured a lot of people's interests.\n\n[P vs NP](https://en.wikipedia.org/wiki/P_versus_NP_problem) is an elusive problem at the intersection of mathematics and computer science.  If you're not already familiar with this problem, then there are plenty of helpful resources available online.  A quick web search will return results with headlines such as \"Explained: P vs. NP\", \"What is the P vs. NP problem and why is it so important?\", and \"The Practical Implication of P vs NP Problem\".\n\n*Cut to the chase:* The P vs NP problem has attracted a lot of attention.  Some suspect that a solution to this problem could be of great practical significance and some think that solving P vs NP could bring fame and fortune with the promise of a [million dollar prize](http://www.claymath.org/millennium-problems/p-vs-np-problem).\n\n### Professional \u0026 amateur researchers continue to submit proposed solutions.\n\n- There is an [extensive list](https://www.win.tue.nl/~gwoegi/P-versus-NP.htm) of articles, papers, and write-ups containing proposed P vs NP solutions.\n\n- Proposed solutions will from time to time appear on [arXiv](https://arxiv.org/) and other platforms for archiving \u0026 publishing.\n\n- Proposed solutions have been submitted on [Stack Exchange](https://cstheory.stackexchange.com/) and even in the comments on complexity theory blogs.\n\n- Proposed solutions have been cold emailed to researchers and are sometimes submitted to journals / conferences.\n\n- I personally have had at least three different people send me their proposed P vs NP solutions.\n\n### What to do if you have a proposed solution?\n\n- *Take a step back* and try to understand what you are doing so that you will be prepared to best explain your approach to others.\n\n- *Start with the small results*.  I believe that any substantial proof should be broken up into smaller pieces that are easier to digest.  If you have a collection of smaller results, you might be able to first publish a paper just on these smaller results.  If your approach has value, then people will ask questions that you haven't considered and these questions could lead you to many more small results and more papers.\n\n- *Your proof technique should mean something* to you.  It's not merely a vehicle to resolve the P vs NP problem.  It should have some reasoning behind it.\n\n- *Be open minded*.  Be conscious of the possibility that you made a mistake and also that others make mistakes.  In particular, there are plenty of mistakes in [published academic papers](https://academia.stackexchange.com/questions/48224/how-common-is-it-for-a-paper-to-be-wrong).\n\n- *Know your niche*.  I generally believe that it's easier to get helpful and thoughtful advice from people within your niche.  For example, if your proposed solution involves vertex cover, then know everything that there is to know about vertex cover.  Talk to people who work on vertex cover and continue working on other problems related to vertex cover.  Recognize that it might be difficult for someone to review your paper if they don't have extensive knowledge of the vertex cover problem.\n        \n### My personal experience with proposed P vs NP solutions\n\n- I personally have reviewed at least three proposed P vs NP solutions.  Here are some of my insights for anyone who plans to review a proposed solution:\n  - *Direct communication is important* because it's easy to get stuck when trying to understand someone else's proof.\n  - *Failed proofs can lead to interesting results*.  Even when there is a bug in a proof, there can be interesting lemmas and small results that should be pursued further.  It was saddening in a few cases where the submitter had little interest in further pursuing such results that I believe could have potentially been published.\n  - *Reviewing can be strenuous and difficult*.  It can be challenging to understand someone else's ideas, especially if their approach is totally new or if it is lacking in presentation because details are missing and proofs are not broken up into smaller more digestible pieces.\n\n- I have proposed solutions to open problems in complexity theory.  Many of my proposed solutions turn out to be false.  But, in some cases one or more of the following applied:\n  - They still led to interesting insights and important smaller results.\n  - They led to interesting discussions and new collaborations.\n  - They required a lot of effort before coming to a clear resolution.\n  \n\u003c!---\n- Several complexity theorists that I have communicated with have expressed to me that they receive proposed P vs NP solutions for review. I once had the privileged to have lunch across from [Stephen Cook](https://en.wikipedia.org/wiki/Stephen_Cook) at a research forum.  He confirmed to me that he has received many proposed P vs NP solutions over the years.\n\n### What is the purpose of this repository?\n\n- This repo is meant to be a resource for people who work on the P vs NP problem.\n\n- This repo is only helpful if people use it and contribute to it.  All are welcome to share ideas and get involved.\n\n- This repo contains some personal opinions and the content is subject to change over time.  Please be respectful and if you have any issues with the content, please feel free to create an issue or submit a pull request.\n\n--\u003e\n\n### What content can we provide that might be helpful?\n\n- Thoughts, Ideas, and Advice for researchers and reviewers.\n\n- Although I can only review one or two proposed solutions per year, I would be happy to be a volunteer reviewer for your proposed P vs NP solution.  Please contact me @ [dff72324@gmail.com](mailto:dff72324@gmail.com).  Also, you are welcome to list links to any of your publicly available proposed solutions within our [Proposed-solutions.md](https://github.com/MichaelWehar/P-vs-NP-Community/blob/master/Proposed-solutions.md) document.\n\n- Would anyone else out there like to be a reviewer for proposed P vs NP solutions?\n\n- Please suggest other things that we can do to help!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmichaelwehar%2Fp-vs-np-community","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmichaelwehar%2Fp-vs-np-community","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmichaelwehar%2Fp-vs-np-community/lists"}