Two corpora, one honest boundary

The Register

All 116 numbered dossiers from Woeginger’s frozen 2016 page. The Register adds 43 post-2016 census entries of its own, numbered 117–159. The two layers remain visibly and editorially distinct.

Historical dossiers 001–116

This is Woeginger’s historical corpus, frozen in September 2016. Its numbering, wording, and three browsable views are preserved.

By dossier number

Dossiers in Woeginger order
Dossier	Claim or work	Author(s)	Year recorded	Direction	Status
001	P=NP	Ted Swart	1986/87	P = NP	Adjudicated
002	Polynomial-Time Partition of a Graph into Cliques	Anatoly Plotnikov	1996	P = NP	Unadjudicated
003	An algorithm with polynomial time complexity for finding clique in a graph; HEWN: A polynomial algorithm for CLIQUE problem	Tang Pushan, Huang Zhijun	Around 1997; 1998	P = NP	Adjudicated
004	Positionality principle for notation and calculation the functions (Volume One)	Miron Telpiz	the second half of the year 2000	P = NP	Unadjudicated
005	Redundancy, Obscurity, Self-Containment & Independence	Seenil Gram	November 13-16, 2001	P ≠ NP	Unadjudicated
006	A polynomial time (heuristic) SAT algorithm	Charles Sauerbier	May 2002	P = NP	Adjudicated
007	Solution of the Linear Ordering Problem (NP=P); A polynomial algorithm for a problem of linear orders	Givi Bolotashvili	March 2003; 1990	P = NP	Unadjudicated
008	Nicholas Argall proved on 25 March 2003 that P=NP is undecidable.	Nicholas Argall	25 March 2003	Other	Unadjudicated
009	Consequences of an exotic definition for P=NP	N.C.A. da Costa, F.A. Doria	2003	Other	Adjudicated
010	Hubert Chen has a webpage (2003) with a really short argument that "P-not-equal-to-NP":	Hubert Chen	2003	P ≠ NP	Unadjudicated
011	Evidence that P is not equal to NP; P is not equal to NP	Craig Alan Feinstein	2003/04	Other	Adjudicated
012	Linear Algebra, Lie Algebra and their applications to P versus NP	Ki-Bong Nam, S.H. Wang, Yang Gon Kim	2004	P ≠ NP	Unadjudicated
013	P versus NP problem solution	Mikhail N. Kupchik	spring 2004	P ≠ NP	Unadjudicated
014	P=NP	Selmer Bringsjord, Joshua Taylor	June 2004	P = NP	Unadjudicated
015	Some consequences of defining mathematical objects constructively and mathematical truth effectively; A density-based approach for non-heuristic approximations of prime counting functions	Bhupinder Singh Anand	2004; 2015	P ≠ NP	Unadjudicated
016	P is not NP	Marius Ionescu	September 2004	P ≠ NP	Unadjudicated
017	P=NP: Linear Programming Formulation of the Traveling Salesman Problem; linear programming formulation of the QAP (quadratic assignment problem); Linear programming formulation of the vertex colouring problem; Linear programming formulation of the set partitioning problem; Advances in Combinatorial Optimization	Moustapha Diaby, Mark H Karwan	October 2004; October 2005; 2010; April 2016	P = NP	Unadjudicated
018	Mircea Alexandru Popescu Moscu introduced an invariance principle of complexity hierarchies.	Mircea Alexandru Popescu Moscu	November 2004	P ≠ NP	Unadjudicated
019	A Polynomial-time Exact Algorithm for the Subset Sum Problem	Andrea Bianchini	January 2005	P = NP	Unadjudicated
020	Raju Renjit Grover proved that P is not equal to NP, and also that P is not equal to co-NP.	Raju Renjit Grover	February 2005	P ≠ NP	Unadjudicated
021	Dr. Viktor V. Ivanov proved that P is not equal to NP.	Dr. Viktor V. Ivanov	March 2005; 2014	P ≠ NP	Unadjudicated
022	Is the Halting problem effectively solvable non-algorithmically, and is the Goedel sentence in NP, but not in P?	Bhupinder Singh Anand	June 2005	P ≠ NP	Unadjudicated
023	Complexity Theory for Simpletons; Complexity science for simpletons	Craig Alan Feinstein	July 2005; July 2006	P ≠ NP	Unadjudicated
024	Proof-sketch: Why NP is not P	Lev Gordeev	Summer 2005	P ≠ NP	Unadjudicated
025	Two Dimensional Formulas and Tautology Checking	Lokman Kolukisa	October 2005	P = NP	Unadjudicated
026	A polynomial-time algorithm for Circuit-SAT; A polynomial-time heuristic for Circuit-SAT	Francesco Capasso	November 2005	P = NP	Adjudicated
027	Proving that P is not equal to NP and that P is not equal to the intersection of NP and co-NP	Ron Cohen	November 2005	P ≠ NP	Unadjudicated
028	Sigma-notation and the equivalence of P and NP classes	Miron Teplitz	December 2005	P = NP	Unadjudicated
029	His main contribution is a linear programming formulation of the TSP with O(n^5) variables and O(n^4) constraints.	Dr. Joachim Mertz	2005	P = NP	Unadjudicated
030	P =/= NP	Bhupinder Singh Anand	March 2006	P ≠ NP	Unadjudicated
031	A New and Elegant Argument that P is not NP	Craig Alan Feinstein	July 2006	P ≠ NP	Unadjudicated
032	Mohamed Mimouni proved P=NP by constructing a polynomial time algorithm for the clique problem.	Mohamed Mimouni	August 2006	P = NP	Unadjudicated
033	A Polynomial Time Algorithm for The Traveling Salesman Problem	Sergey Gubin	October 2006	P = NP	Adjudicated
034	Complexity Considerations, cSAT Lower Bound	Radoslaw Hofman	2006	P ≠ NP	Unadjudicated
035	co-NP Is Equal To NP	Raju Renjit	November 2006	Other	Unadjudicated
036	Using Disentangled States and Algorithmic Information Theory to Solve the P Versus NP Problem	Rubens Ramos Viana	November 2006	P ≠ NP	Unadjudicated
037	The Asymmetric Traveling Salesman Problem	Howard Kleiman	December 2006	P = NP	Unadjudicated
038	Finding Hamiltonian cycle in polynomial time	Khadija Riaz, Malik Sikander Hayat Khiyal	2006	P = NP	Unadjudicated
039	Experimental Algorithm for the Maximum Independent Set Problem	Anatoly D. Plotnikov	June 2007	P = NP	Unadjudicated
040	The Complexity of HCP in Digraps with Degree Bound Two	Guohun Zhu	summer 2007	P = NP	Unadjudicated
041	Graph Isomorphism is PSPACE-complete; A Polynomial Time Algorithm for Graph Isomorphism	Matthew Delacorte, Reiner Czerwinski	August 2007; November 2007	P = NP	Unadjudicated
042	The Proof of P=NP	Cynthia Ann Harlan Krieger, Lee K. Jones	March 2008	P = NP	Unadjudicated
043	P is a proper subset of NP	Jerrald Meek	April 2008	P ≠ NP	Unadjudicated
044	A trivial solution to the PvNP problem	Bhupinder Singh Anand	June 2008	P ≠ NP	Unadjudicated
045	The Kleene-Rosser Paradox, The Liar's Paradox & A Fuzzy Logic Programming Paradox Imply SAT is (NOT) NP-complete	Rafee Ebrahim Kamouna	June 2008	P = NP	Unadjudicated
046	Analysis of the postulates produced by Karp's Theorem	Jerrald Meek	August 2008	P ≠ NP	Unadjudicated
047	On the existence of polynomial-time algorithms to the subset sum problem	Jorma Jormakka	September 2008	P ≠ NP	Unadjudicated
048	P is not equal to NP	Sten-Ake Tarnlund	October 2008; September 2013	P ≠ NP	Unadjudicated
049	A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes; A polynomial-time algorithm for the maximum clique problem	Zohreh O. Akbari	November 2008; 2013	P = NP	Unadjudicated
050	The Collapse of the Polynomial Hierarchy: NP=P	Javaid Aslam	December 2008	P = NP	Adjudicated
051	P=NP; M�todo de soluci�n para sistemas de ecuaciones simult�neas sobre un Campo de Galois y aplicaciones en Inteligencia Artificial	Rafael Valls Hidalgo-Gato	March 2009; October 1985	P = NP	Unadjudicated
052	On the 1st of April 2009, Doron Zeilberger proved that P is equal to NP.	Doron Zeilberger	1st of April 2009	P = NP	Adjudicated
053	A Polynomial Time Algorithm for the Hamilton Circuit Problem	Xinwen Jiang	April 2009; 2007; 2010; 2011; May 2013	P = NP	Unadjudicated
054	Physical portrayal of computational complexity	Arto Annila	June 2009	P ≠ NP	Unadjudicated
055	P != NP Proof	Andre Luiz Barbosa	July 2009	P ≠ NP	Unadjudicated
056	R�solution du partition problem par une approche arithm�tique	Yann Dujardin	September 2009	P = NP	Unadjudicated
057	Method of resolution of 3SAT in polynomial time	Luigi Salemi	September 2009	P = NP	Unadjudicated
058	A Possible New Approach to Resolving Open Problems in Computer Science	Ari Blinder	December 2009	P ≠ NP	Adjudicated
059	Computationally Difficult Problems: Some Investigations	Narendra S. Chaudhari	2009	P = NP	Unadjudicated
060	A Polynomial Time Algorithm for Hamilton Cycle and Its Proof	Lizhi Du	April 2010	P = NP	Unadjudicated
061	A Proof for P vs. NP Problem	Changlin Wan	May 2010	P = NP	Unadjudicated
062	The Complexity Of The NP-Class	Carlos Barron-Romero	June 2010	P ≠ NP	Unadjudicated
063	Mirrored Language Structure and Innate Logic of the Human Brain as a Computable Model of the Oracle Turing Machine; Knowledge Recognition Algorithm enables P = NP	Han Xiao Wen	June 2010; September 2010	P = NP	Unadjudicated
064	Polynomial complexity algorithm for Max-Cut problem	Mikhail Katkov	July 2010	P = NP	Unadjudicated
065	P!=NP	Vinay Deolalikar	the beginning of August 2010	P ≠ NP	Unadjudicated
066	Complementary to Yannakakis' theorem	Sergey Gubin	August 2010	P = NP	Adjudicated
067	Non-Orthodox Combinatorial Models Based on Discordant Structures	Vladimir Romanov	November 2010	P = NP	Unadjudicated
068	A Solution to the P versus NP Problem	Frank Vega Delgado	November 2010	P ≠ NP	Unadjudicated
069	The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P	Carlos Barron-Romero	December 2010	P ≠ NP	Unadjudicated
070	THE ANSWER TO THE P/NP PROBLEM IS P≠NP!	Bangyan Wen, Yi Lin	December 2010	P ≠ NP	Unadjudicated
071	The Complexity of 3SAT_N and the P versus NP Problem	Ruijia Liao	January 2011	P ≠ NP	Unadjudicated
072	Computational Complexity on Signed Numbers	Stefan Jaeger	April 2011	Other	Unadjudicated
073	The 3-satisfiability problem	Amar Mukherjee	April 2011	P = NP	Unadjudicated
074	A Polynomial Algorithm for 3-sat	Angela Weiss	spring 2011	P = NP	Unadjudicated
075	Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields	Matt Groff	June 2011	P = NP	Unadjudicated
076	Algorithmic complexity of pair cleaning method for k-satisfiability problem	Sergey Kardash	July 2011	P = NP	Unadjudicated
077	On the relationship between classes P and NP; About set-theoretic properties of one-way functions; On the structure of the class NP	Anatoly Plotnikov	September/October 2011	P ≠ NP	Unadjudicated
078	NP is not AL and P is not NC is not NL is not L	Koji Kobayashi	October 2011	P ≠ NP	Unadjudicated
079	Algorithm that Solves 3-SAT in Polynomial Time	Jason W. Steinmetz	October 2011	P = NP	Unadjudicated
080	Is it possible to find the maximum clique in general graphs?	Jose Ignacio Alvarez-Hamelin	October 2011	P = NP	Unadjudicated
081	Construction of an NP Problem with an Exponential Lower Bound	Roman Yampolskiy	November 2011	P ≠ NP	Unadjudicated
082	The Computational Complexity of the Traveling Salesman Problem	Craig Alan Feinstein	November 2011	P ≠ NP	Unadjudicated
083	Just How Random Are Your Answers?	Jeffrey W. Holcomb	fall 2011	P ≠ NP	Unadjudicated
084	As Velocity Approaches Light Speed, P Becomes Equivalent to NP for Computations Using Zero-Mass Particles	Douglas Youvan	January 2012	P = NP	Unadjudicated
085	P vs NP	Gilberto Rodrigo Diduch	January 2012	P ≠ NP	Unadjudicated
086	Topological approach to solve P versus NP	Koji Kobayashi	February 2012	P ≠ NP	Unadjudicated
087	The existence of one-way functions; P versus UP	Frank Vega Delgado	February 2012	P ≠ NP	Adjudicated
088	Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity	Minseong Kim	March 2012	P ≠ NP	Unadjudicated
089	How to solve kSAT in polynomial time	Algirdas Antano Maknickas	March 2011	P = NP	Unadjudicated
090	From classical versus quantum algorithms to P versus NP	Michel Feldmann	May 2012	P = NP	Unadjudicated
091	Computing Cliques is Intractable	Junichiro Fukuyama	summer 2012; May 2013	P ≠ NP	Unadjudicated
092	Integer factorization and Discrete Logarithm problem are neither in P nor NP-complete; Relationship between circuit complexity and symmetry	Satoshi Tazawa	July 2012	P ≠ NP	Unadjudicated
093	A Constructive Algorithm to Prove P=NP	Wen-Qi Duan	July 2012	P = NP	Unadjudicated
094	The proof is constructive, and explicitly gives a polynomial time deterministic algorithm that determines whether there exists a polynomial-length accepting computational path for a given non-deterministic single-tape Turing machine.	Sergey V. Yakhontov	September 2012	P = NP	Unadjudicated
095	On the principal impossibility to prove P=NP	Natalia L. Malinina	November 2012	Other	Unadjudicated
096	Polynomial Exact-3-SAT Solving Algorithm; Polynomial SAT-Solver - Algorithm Explanation	Louis Coder	December 2012; December 2013	P = NP	Unadjudicated
097	A DP Approach to Hamiltonian Path Problem	Dmitriy Nuriyev	January 2013	P = NP	Unadjudicated
098	Linear Programming Formulation of Boolean Satisfiability Problem	Algirdas Antano Maknickas	March 2013	P = NP	Unadjudicated
099	The Lower Border of Complexity of Algorithm of the Elementary NP-Complete Task (The Most Condensed Version)	Rustem Chingizovich Valeyev	August 2013	P ≠ NP	Unadjudicated
100	Solving 3-SAT and 3-dimensional matching in polynomial time	Frederic Gillet	October 2013	P = NP	Adjudicated
101	A Algorithm for the Hamilton Circuit Problem	Hanlin Liu	January 2014	P = NP	Unadjudicated
102	A Polynomial Time Solution to the Clique Problem	Pawan Tamta, B.P. Pande, H.S. Dhami	February 2014	P = NP	Adjudicated
103	Approximation Resistance by Disguising Biased Distributions	Peng Cui	February 2014	P = NP	Unadjudicated
104	The P versus NP Problem in Quantum Physics	Daegene Song	February 2014	P ≠ NP	Unadjudicated
105	P not equal NP by modus tollens	Joonmo Kim	March 2014	P ≠ NP	Adjudicated
106	Polynomial solvability of NP-complete problems	Anatoly Panyukov	September 2014	P = NP	Unadjudicated
107	A Polynomial Time Algorithm For Solving Clique Problems	Michael LaPlante	March 2015	P = NP	Adjudicated
108	Understanding SAT is in P	Alejandro Sanchez Guinea	April 2015	P = NP	Unadjudicated
109	Solution of P versus NP Problem	Frank Vega	June 2015	P = NP	Unadjudicated
110	Testing a new idea to solve the P = NP problem with mathematical induction	Yubin Huang	October 2015	P = NP	Unadjudicated
111	P vs. NP; Is P equal to NP?	Daniel Uribe, Frank Vega	January 2016; February 2016	P ≠ NP	Unadjudicated
112	On Alternation and the Union Theorem	Mathias Hauptmann	February 2016	P ≠ NP	Unadjudicated
113	Philosophical Solution to P=?NP: P is Equal to NP	Steven Meyer	March 2016	P = NP	Unadjudicated
114	The Tau One-Way Functions Class: P != NP	Javier A. Arroyo-Figueroa	April 2016	P ≠ NP	Unadjudicated
115	An Attempt to Demonstrate P=NP	Eli Halylaurin	summer 2016	P = NP	Unadjudicated
116	On the Existence of Weak One-Way Functions	Stefan Rass	September 2016	P ≠ NP	Unadjudicated

By first recorded year

Dossiers sorted by first year named
Dossier	Claim or work	Author(s)	Year recorded	Direction	Status
001	P=NP	Ted Swart	1986/87	P = NP	Adjudicated
002	Polynomial-Time Partition of a Graph into Cliques	Anatoly Plotnikov	1996	P = NP	Unadjudicated
003	An algorithm with polynomial time complexity for finding clique in a graph; HEWN: A polynomial algorithm for CLIQUE problem	Tang Pushan, Huang Zhijun	Around 1997; 1998	P = NP	Adjudicated
004	Positionality principle for notation and calculation the functions (Volume One)	Miron Telpiz	the second half of the year 2000	P = NP	Unadjudicated
005	Redundancy, Obscurity, Self-Containment & Independence	Seenil Gram	November 13-16, 2001	P ≠ NP	Unadjudicated
006	A polynomial time (heuristic) SAT algorithm	Charles Sauerbier	May 2002	P = NP	Adjudicated
007	Solution of the Linear Ordering Problem (NP=P); A polynomial algorithm for a problem of linear orders	Givi Bolotashvili	March 2003; 1990	P = NP	Unadjudicated
008	Nicholas Argall proved on 25 March 2003 that P=NP is undecidable.	Nicholas Argall	25 March 2003	Other	Unadjudicated
009	Consequences of an exotic definition for P=NP	N.C.A. da Costa, F.A. Doria	2003	Other	Adjudicated
010	Hubert Chen has a webpage (2003) with a really short argument that "P-not-equal-to-NP":	Hubert Chen	2003	P ≠ NP	Unadjudicated
011	Evidence that P is not equal to NP; P is not equal to NP	Craig Alan Feinstein	2003/04	Other	Adjudicated
012	Linear Algebra, Lie Algebra and their applications to P versus NP	Ki-Bong Nam, S.H. Wang, Yang Gon Kim	2004	P ≠ NP	Unadjudicated
013	P versus NP problem solution	Mikhail N. Kupchik	spring 2004	P ≠ NP	Unadjudicated
014	P=NP	Selmer Bringsjord, Joshua Taylor	June 2004	P = NP	Unadjudicated
015	Some consequences of defining mathematical objects constructively and mathematical truth effectively; A density-based approach for non-heuristic approximations of prime counting functions	Bhupinder Singh Anand	2004; 2015	P ≠ NP	Unadjudicated
016	P is not NP	Marius Ionescu	September 2004	P ≠ NP	Unadjudicated
017	P=NP: Linear Programming Formulation of the Traveling Salesman Problem; linear programming formulation of the QAP (quadratic assignment problem); Linear programming formulation of the vertex colouring problem; Linear programming formulation of the set partitioning problem; Advances in Combinatorial Optimization	Moustapha Diaby, Mark H Karwan	October 2004; October 2005; 2010; April 2016	P = NP	Unadjudicated
018	Mircea Alexandru Popescu Moscu introduced an invariance principle of complexity hierarchies.	Mircea Alexandru Popescu Moscu	November 2004	P ≠ NP	Unadjudicated
019	A Polynomial-time Exact Algorithm for the Subset Sum Problem	Andrea Bianchini	January 2005	P = NP	Unadjudicated
020	Raju Renjit Grover proved that P is not equal to NP, and also that P is not equal to co-NP.	Raju Renjit Grover	February 2005	P ≠ NP	Unadjudicated
021	Dr. Viktor V. Ivanov proved that P is not equal to NP.	Dr. Viktor V. Ivanov	March 2005; 2014	P ≠ NP	Unadjudicated
022	Is the Halting problem effectively solvable non-algorithmically, and is the Goedel sentence in NP, but not in P?	Bhupinder Singh Anand	June 2005	P ≠ NP	Unadjudicated
023	Complexity Theory for Simpletons; Complexity science for simpletons	Craig Alan Feinstein	July 2005; July 2006	P ≠ NP	Unadjudicated
024	Proof-sketch: Why NP is not P	Lev Gordeev	Summer 2005	P ≠ NP	Unadjudicated
025	Two Dimensional Formulas and Tautology Checking	Lokman Kolukisa	October 2005	P = NP	Unadjudicated
026	A polynomial-time algorithm for Circuit-SAT; A polynomial-time heuristic for Circuit-SAT	Francesco Capasso	November 2005	P = NP	Adjudicated
027	Proving that P is not equal to NP and that P is not equal to the intersection of NP and co-NP	Ron Cohen	November 2005	P ≠ NP	Unadjudicated
028	Sigma-notation and the equivalence of P and NP classes	Miron Teplitz	December 2005	P = NP	Unadjudicated
029	His main contribution is a linear programming formulation of the TSP with O(n^5) variables and O(n^4) constraints.	Dr. Joachim Mertz	2005	P = NP	Unadjudicated
030	P =/= NP	Bhupinder Singh Anand	March 2006	P ≠ NP	Unadjudicated
031	A New and Elegant Argument that P is not NP	Craig Alan Feinstein	July 2006	P ≠ NP	Unadjudicated
032	Mohamed Mimouni proved P=NP by constructing a polynomial time algorithm for the clique problem.	Mohamed Mimouni	August 2006	P = NP	Unadjudicated
033	A Polynomial Time Algorithm for The Traveling Salesman Problem	Sergey Gubin	October 2006	P = NP	Adjudicated
034	Complexity Considerations, cSAT Lower Bound	Radoslaw Hofman	2006	P ≠ NP	Unadjudicated
035	co-NP Is Equal To NP	Raju Renjit	November 2006	Other	Unadjudicated
036	Using Disentangled States and Algorithmic Information Theory to Solve the P Versus NP Problem	Rubens Ramos Viana	November 2006	P ≠ NP	Unadjudicated
037	The Asymmetric Traveling Salesman Problem	Howard Kleiman	December 2006	P = NP	Unadjudicated
038	Finding Hamiltonian cycle in polynomial time	Khadija Riaz, Malik Sikander Hayat Khiyal	2006	P = NP	Unadjudicated
039	Experimental Algorithm for the Maximum Independent Set Problem	Anatoly D. Plotnikov	June 2007	P = NP	Unadjudicated
040	The Complexity of HCP in Digraps with Degree Bound Two	Guohun Zhu	summer 2007	P = NP	Unadjudicated
041	Graph Isomorphism is PSPACE-complete; A Polynomial Time Algorithm for Graph Isomorphism	Matthew Delacorte, Reiner Czerwinski	August 2007; November 2007	P = NP	Unadjudicated
042	The Proof of P=NP	Cynthia Ann Harlan Krieger, Lee K. Jones	March 2008	P = NP	Unadjudicated
043	P is a proper subset of NP	Jerrald Meek	April 2008	P ≠ NP	Unadjudicated
044	A trivial solution to the PvNP problem	Bhupinder Singh Anand	June 2008	P ≠ NP	Unadjudicated
045	The Kleene-Rosser Paradox, The Liar's Paradox & A Fuzzy Logic Programming Paradox Imply SAT is (NOT) NP-complete	Rafee Ebrahim Kamouna	June 2008	P = NP	Unadjudicated
046	Analysis of the postulates produced by Karp's Theorem	Jerrald Meek	August 2008	P ≠ NP	Unadjudicated
047	On the existence of polynomial-time algorithms to the subset sum problem	Jorma Jormakka	September 2008	P ≠ NP	Unadjudicated
048	P is not equal to NP	Sten-Ake Tarnlund	October 2008; September 2013	P ≠ NP	Unadjudicated
049	A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes; A polynomial-time algorithm for the maximum clique problem	Zohreh O. Akbari	November 2008; 2013	P = NP	Unadjudicated
050	The Collapse of the Polynomial Hierarchy: NP=P	Javaid Aslam	December 2008	P = NP	Adjudicated
051	P=NP; M�todo de soluci�n para sistemas de ecuaciones simult�neas sobre un Campo de Galois y aplicaciones en Inteligencia Artificial	Rafael Valls Hidalgo-Gato	March 2009; October 1985	P = NP	Unadjudicated
052	On the 1st of April 2009, Doron Zeilberger proved that P is equal to NP.	Doron Zeilberger	1st of April 2009	P = NP	Adjudicated
053	A Polynomial Time Algorithm for the Hamilton Circuit Problem	Xinwen Jiang	April 2009; 2007; 2010; 2011; May 2013	P = NP	Unadjudicated
054	Physical portrayal of computational complexity	Arto Annila	June 2009	P ≠ NP	Unadjudicated
055	P != NP Proof	Andre Luiz Barbosa	July 2009	P ≠ NP	Unadjudicated
056	R�solution du partition problem par une approche arithm�tique	Yann Dujardin	September 2009	P = NP	Unadjudicated
057	Method of resolution of 3SAT in polynomial time	Luigi Salemi	September 2009	P = NP	Unadjudicated
058	A Possible New Approach to Resolving Open Problems in Computer Science	Ari Blinder	December 2009	P ≠ NP	Adjudicated
059	Computationally Difficult Problems: Some Investigations	Narendra S. Chaudhari	2009	P = NP	Unadjudicated
060	A Polynomial Time Algorithm for Hamilton Cycle and Its Proof	Lizhi Du	April 2010	P = NP	Unadjudicated
061	A Proof for P vs. NP Problem	Changlin Wan	May 2010	P = NP	Unadjudicated
062	The Complexity Of The NP-Class	Carlos Barron-Romero	June 2010	P ≠ NP	Unadjudicated
063	Mirrored Language Structure and Innate Logic of the Human Brain as a Computable Model of the Oracle Turing Machine; Knowledge Recognition Algorithm enables P = NP	Han Xiao Wen	June 2010; September 2010	P = NP	Unadjudicated
064	Polynomial complexity algorithm for Max-Cut problem	Mikhail Katkov	July 2010	P = NP	Unadjudicated
065	P!=NP	Vinay Deolalikar	the beginning of August 2010	P ≠ NP	Unadjudicated
066	Complementary to Yannakakis' theorem	Sergey Gubin	August 2010	P = NP	Adjudicated
067	Non-Orthodox Combinatorial Models Based on Discordant Structures	Vladimir Romanov	November 2010	P = NP	Unadjudicated
068	A Solution to the P versus NP Problem	Frank Vega Delgado	November 2010	P ≠ NP	Unadjudicated
069	The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P	Carlos Barron-Romero	December 2010	P ≠ NP	Unadjudicated
070	THE ANSWER TO THE P/NP PROBLEM IS P≠NP!	Bangyan Wen, Yi Lin	December 2010	P ≠ NP	Unadjudicated
071	The Complexity of 3SAT_N and the P versus NP Problem	Ruijia Liao	January 2011	P ≠ NP	Unadjudicated
072	Computational Complexity on Signed Numbers	Stefan Jaeger	April 2011	Other	Unadjudicated
073	The 3-satisfiability problem	Amar Mukherjee	April 2011	P = NP	Unadjudicated
074	A Polynomial Algorithm for 3-sat	Angela Weiss	spring 2011	P = NP	Unadjudicated
075	Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields	Matt Groff	June 2011	P = NP	Unadjudicated
076	Algorithmic complexity of pair cleaning method for k-satisfiability problem	Sergey Kardash	July 2011	P = NP	Unadjudicated
077	On the relationship between classes P and NP; About set-theoretic properties of one-way functions; On the structure of the class NP	Anatoly Plotnikov	September/October 2011	P ≠ NP	Unadjudicated
078	NP is not AL and P is not NC is not NL is not L	Koji Kobayashi	October 2011	P ≠ NP	Unadjudicated
079	Algorithm that Solves 3-SAT in Polynomial Time	Jason W. Steinmetz	October 2011	P = NP	Unadjudicated
080	Is it possible to find the maximum clique in general graphs?	Jose Ignacio Alvarez-Hamelin	October 2011	P = NP	Unadjudicated
081	Construction of an NP Problem with an Exponential Lower Bound	Roman Yampolskiy	November 2011	P ≠ NP	Unadjudicated
082	The Computational Complexity of the Traveling Salesman Problem	Craig Alan Feinstein	November 2011	P ≠ NP	Unadjudicated
083	Just How Random Are Your Answers?	Jeffrey W. Holcomb	fall 2011	P ≠ NP	Unadjudicated
089	How to solve kSAT in polynomial time	Algirdas Antano Maknickas	March 2011	P = NP	Unadjudicated
084	As Velocity Approaches Light Speed, P Becomes Equivalent to NP for Computations Using Zero-Mass Particles	Douglas Youvan	January 2012	P = NP	Unadjudicated
085	P vs NP	Gilberto Rodrigo Diduch	January 2012	P ≠ NP	Unadjudicated
086	Topological approach to solve P versus NP	Koji Kobayashi	February 2012	P ≠ NP	Unadjudicated
087	The existence of one-way functions; P versus UP	Frank Vega Delgado	February 2012	P ≠ NP	Adjudicated
088	Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity	Minseong Kim	March 2012	P ≠ NP	Unadjudicated
090	From classical versus quantum algorithms to P versus NP	Michel Feldmann	May 2012	P = NP	Unadjudicated
091	Computing Cliques is Intractable	Junichiro Fukuyama	summer 2012; May 2013	P ≠ NP	Unadjudicated
092	Integer factorization and Discrete Logarithm problem are neither in P nor NP-complete; Relationship between circuit complexity and symmetry	Satoshi Tazawa	July 2012	P ≠ NP	Unadjudicated
093	A Constructive Algorithm to Prove P=NP	Wen-Qi Duan	July 2012	P = NP	Unadjudicated
094	The proof is constructive, and explicitly gives a polynomial time deterministic algorithm that determines whether there exists a polynomial-length accepting computational path for a given non-deterministic single-tape Turing machine.	Sergey V. Yakhontov	September 2012	P = NP	Unadjudicated
095	On the principal impossibility to prove P=NP	Natalia L. Malinina	November 2012	Other	Unadjudicated
096	Polynomial Exact-3-SAT Solving Algorithm; Polynomial SAT-Solver - Algorithm Explanation	Louis Coder	December 2012; December 2013	P = NP	Unadjudicated
097	A DP Approach to Hamiltonian Path Problem	Dmitriy Nuriyev	January 2013	P = NP	Unadjudicated
098	Linear Programming Formulation of Boolean Satisfiability Problem	Algirdas Antano Maknickas	March 2013	P = NP	Unadjudicated
099	The Lower Border of Complexity of Algorithm of the Elementary NP-Complete Task (The Most Condensed Version)	Rustem Chingizovich Valeyev	August 2013	P ≠ NP	Unadjudicated
100	Solving 3-SAT and 3-dimensional matching in polynomial time	Frederic Gillet	October 2013	P = NP	Adjudicated
101	A Algorithm for the Hamilton Circuit Problem	Hanlin Liu	January 2014	P = NP	Unadjudicated
102	A Polynomial Time Solution to the Clique Problem	Pawan Tamta, B.P. Pande, H.S. Dhami	February 2014	P = NP	Adjudicated
103	Approximation Resistance by Disguising Biased Distributions	Peng Cui	February 2014	P = NP	Unadjudicated
104	The P versus NP Problem in Quantum Physics	Daegene Song	February 2014	P ≠ NP	Unadjudicated
105	P not equal NP by modus tollens	Joonmo Kim	March 2014	P ≠ NP	Adjudicated
106	Polynomial solvability of NP-complete problems	Anatoly Panyukov	September 2014	P = NP	Unadjudicated
107	A Polynomial Time Algorithm For Solving Clique Problems	Michael LaPlante	March 2015	P = NP	Adjudicated
108	Understanding SAT is in P	Alejandro Sanchez Guinea	April 2015	P = NP	Unadjudicated
109	Solution of P versus NP Problem	Frank Vega	June 2015	P = NP	Unadjudicated
110	Testing a new idea to solve the P = NP problem with mathematical induction	Yubin Huang	October 2015	P = NP	Unadjudicated
111	P vs. NP; Is P equal to NP?	Daniel Uribe, Frank Vega	January 2016; February 2016	P ≠ NP	Unadjudicated
112	On Alternation and the Union Theorem	Mathias Hauptmann	February 2016	P ≠ NP	Unadjudicated
113	Philosophical Solution to P=?NP: P is Equal to NP	Steven Meyer	March 2016	P = NP	Unadjudicated
114	The Tau One-Way Functions Class: P != NP	Javier A. Arroyo-Figueroa	April 2016	P ≠ NP	Unadjudicated
115	An Attempt to Demonstrate P=NP	Eli Halylaurin	summer 2016	P = NP	Unadjudicated
116	On the Existence of Weak One-Way Functions	Stefan Rass	September 2016	P ≠ NP	Unadjudicated

By direction

Dossiers grouped by claimed direction
Dossier	Claim or work	Author(s)	Year recorded	Direction	Status
001	P=NP	Ted Swart	1986/87	P = NP	Adjudicated
002	Polynomial-Time Partition of a Graph into Cliques	Anatoly Plotnikov	1996	P = NP	Unadjudicated
003	An algorithm with polynomial time complexity for finding clique in a graph; HEWN: A polynomial algorithm for CLIQUE problem	Tang Pushan, Huang Zhijun	Around 1997; 1998	P = NP	Adjudicated
004	Positionality principle for notation and calculation the functions (Volume One)	Miron Telpiz	the second half of the year 2000	P = NP	Unadjudicated
006	A polynomial time (heuristic) SAT algorithm	Charles Sauerbier	May 2002	P = NP	Adjudicated
007	Solution of the Linear Ordering Problem (NP=P); A polynomial algorithm for a problem of linear orders	Givi Bolotashvili	March 2003; 1990	P = NP	Unadjudicated
014	P=NP	Selmer Bringsjord, Joshua Taylor	June 2004	P = NP	Unadjudicated
017	P=NP: Linear Programming Formulation of the Traveling Salesman Problem; linear programming formulation of the QAP (quadratic assignment problem); Linear programming formulation of the vertex colouring problem; Linear programming formulation of the set partitioning problem; Advances in Combinatorial Optimization	Moustapha Diaby, Mark H Karwan	October 2004; October 2005; 2010; April 2016	P = NP	Unadjudicated
019	A Polynomial-time Exact Algorithm for the Subset Sum Problem	Andrea Bianchini	January 2005	P = NP	Unadjudicated
025	Two Dimensional Formulas and Tautology Checking	Lokman Kolukisa	October 2005	P = NP	Unadjudicated
026	A polynomial-time algorithm for Circuit-SAT; A polynomial-time heuristic for Circuit-SAT	Francesco Capasso	November 2005	P = NP	Adjudicated
028	Sigma-notation and the equivalence of P and NP classes	Miron Teplitz	December 2005	P = NP	Unadjudicated
029	His main contribution is a linear programming formulation of the TSP with O(n^5) variables and O(n^4) constraints.	Dr. Joachim Mertz	2005	P = NP	Unadjudicated
032	Mohamed Mimouni proved P=NP by constructing a polynomial time algorithm for the clique problem.	Mohamed Mimouni	August 2006	P = NP	Unadjudicated
033	A Polynomial Time Algorithm for The Traveling Salesman Problem	Sergey Gubin	October 2006	P = NP	Adjudicated
037	The Asymmetric Traveling Salesman Problem	Howard Kleiman	December 2006	P = NP	Unadjudicated
038	Finding Hamiltonian cycle in polynomial time	Khadija Riaz, Malik Sikander Hayat Khiyal	2006	P = NP	Unadjudicated
039	Experimental Algorithm for the Maximum Independent Set Problem	Anatoly D. Plotnikov	June 2007	P = NP	Unadjudicated
040	The Complexity of HCP in Digraps with Degree Bound Two	Guohun Zhu	summer 2007	P = NP	Unadjudicated
041	Graph Isomorphism is PSPACE-complete; A Polynomial Time Algorithm for Graph Isomorphism	Matthew Delacorte, Reiner Czerwinski	August 2007; November 2007	P = NP	Unadjudicated
042	The Proof of P=NP	Cynthia Ann Harlan Krieger, Lee K. Jones	March 2008	P = NP	Unadjudicated
045	The Kleene-Rosser Paradox, The Liar's Paradox & A Fuzzy Logic Programming Paradox Imply SAT is (NOT) NP-complete	Rafee Ebrahim Kamouna	June 2008	P = NP	Unadjudicated
049	A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes; A polynomial-time algorithm for the maximum clique problem	Zohreh O. Akbari	November 2008; 2013	P = NP	Unadjudicated
050	The Collapse of the Polynomial Hierarchy: NP=P	Javaid Aslam	December 2008	P = NP	Adjudicated
051	P=NP; M�todo de soluci�n para sistemas de ecuaciones simult�neas sobre un Campo de Galois y aplicaciones en Inteligencia Artificial	Rafael Valls Hidalgo-Gato	March 2009; October 1985	P = NP	Unadjudicated
052	On the 1st of April 2009, Doron Zeilberger proved that P is equal to NP.	Doron Zeilberger	1st of April 2009	P = NP	Adjudicated
053	A Polynomial Time Algorithm for the Hamilton Circuit Problem	Xinwen Jiang	April 2009; 2007; 2010; 2011; May 2013	P = NP	Unadjudicated
056	R�solution du partition problem par une approche arithm�tique	Yann Dujardin	September 2009	P = NP	Unadjudicated
057	Method of resolution of 3SAT in polynomial time	Luigi Salemi	September 2009	P = NP	Unadjudicated
059	Computationally Difficult Problems: Some Investigations	Narendra S. Chaudhari	2009	P = NP	Unadjudicated
060	A Polynomial Time Algorithm for Hamilton Cycle and Its Proof	Lizhi Du	April 2010	P = NP	Unadjudicated
061	A Proof for P vs. NP Problem	Changlin Wan	May 2010	P = NP	Unadjudicated
063	Mirrored Language Structure and Innate Logic of the Human Brain as a Computable Model of the Oracle Turing Machine; Knowledge Recognition Algorithm enables P = NP	Han Xiao Wen	June 2010; September 2010	P = NP	Unadjudicated
064	Polynomial complexity algorithm for Max-Cut problem	Mikhail Katkov	July 2010	P = NP	Unadjudicated
066	Complementary to Yannakakis' theorem	Sergey Gubin	August 2010	P = NP	Adjudicated
067	Non-Orthodox Combinatorial Models Based on Discordant Structures	Vladimir Romanov	November 2010	P = NP	Unadjudicated
073	The 3-satisfiability problem	Amar Mukherjee	April 2011	P = NP	Unadjudicated
074	A Polynomial Algorithm for 3-sat	Angela Weiss	spring 2011	P = NP	Unadjudicated
075	Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields	Matt Groff	June 2011	P = NP	Unadjudicated
076	Algorithmic complexity of pair cleaning method for k-satisfiability problem	Sergey Kardash	July 2011	P = NP	Unadjudicated
079	Algorithm that Solves 3-SAT in Polynomial Time	Jason W. Steinmetz	October 2011	P = NP	Unadjudicated
080	Is it possible to find the maximum clique in general graphs?	Jose Ignacio Alvarez-Hamelin	October 2011	P = NP	Unadjudicated
089	How to solve kSAT in polynomial time	Algirdas Antano Maknickas	March 2011	P = NP	Unadjudicated
084	As Velocity Approaches Light Speed, P Becomes Equivalent to NP for Computations Using Zero-Mass Particles	Douglas Youvan	January 2012	P = NP	Unadjudicated
090	From classical versus quantum algorithms to P versus NP	Michel Feldmann	May 2012	P = NP	Unadjudicated
093	A Constructive Algorithm to Prove P=NP	Wen-Qi Duan	July 2012	P = NP	Unadjudicated
094	The proof is constructive, and explicitly gives a polynomial time deterministic algorithm that determines whether there exists a polynomial-length accepting computational path for a given non-deterministic single-tape Turing machine.	Sergey V. Yakhontov	September 2012	P = NP	Unadjudicated
096	Polynomial Exact-3-SAT Solving Algorithm; Polynomial SAT-Solver - Algorithm Explanation	Louis Coder	December 2012; December 2013	P = NP	Unadjudicated
097	A DP Approach to Hamiltonian Path Problem	Dmitriy Nuriyev	January 2013	P = NP	Unadjudicated
098	Linear Programming Formulation of Boolean Satisfiability Problem	Algirdas Antano Maknickas	March 2013	P = NP	Unadjudicated
100	Solving 3-SAT and 3-dimensional matching in polynomial time	Frederic Gillet	October 2013	P = NP	Adjudicated
101	A Algorithm for the Hamilton Circuit Problem	Hanlin Liu	January 2014	P = NP	Unadjudicated
102	A Polynomial Time Solution to the Clique Problem	Pawan Tamta, B.P. Pande, H.S. Dhami	February 2014	P = NP	Adjudicated
103	Approximation Resistance by Disguising Biased Distributions	Peng Cui	February 2014	P = NP	Unadjudicated
106	Polynomial solvability of NP-complete problems	Anatoly Panyukov	September 2014	P = NP	Unadjudicated
107	A Polynomial Time Algorithm For Solving Clique Problems	Michael LaPlante	March 2015	P = NP	Adjudicated
108	Understanding SAT is in P	Alejandro Sanchez Guinea	April 2015	P = NP	Unadjudicated
109	Solution of P versus NP Problem	Frank Vega	June 2015	P = NP	Unadjudicated
110	Testing a new idea to solve the P = NP problem with mathematical induction	Yubin Huang	October 2015	P = NP	Unadjudicated
113	Philosophical Solution to P=?NP: P is Equal to NP	Steven Meyer	March 2016	P = NP	Unadjudicated
115	An Attempt to Demonstrate P=NP	Eli Halylaurin	summer 2016	P = NP	Unadjudicated
005	Redundancy, Obscurity, Self-Containment & Independence	Seenil Gram	November 13-16, 2001	P ≠ NP	Unadjudicated
010	Hubert Chen has a webpage (2003) with a really short argument that "P-not-equal-to-NP":	Hubert Chen	2003	P ≠ NP	Unadjudicated
012	Linear Algebra, Lie Algebra and their applications to P versus NP	Ki-Bong Nam, S.H. Wang, Yang Gon Kim	2004	P ≠ NP	Unadjudicated
013	P versus NP problem solution	Mikhail N. Kupchik	spring 2004	P ≠ NP	Unadjudicated
015	Some consequences of defining mathematical objects constructively and mathematical truth effectively; A density-based approach for non-heuristic approximations of prime counting functions	Bhupinder Singh Anand	2004; 2015	P ≠ NP	Unadjudicated
016	P is not NP	Marius Ionescu	September 2004	P ≠ NP	Unadjudicated
018	Mircea Alexandru Popescu Moscu introduced an invariance principle of complexity hierarchies.	Mircea Alexandru Popescu Moscu	November 2004	P ≠ NP	Unadjudicated
020	Raju Renjit Grover proved that P is not equal to NP, and also that P is not equal to co-NP.	Raju Renjit Grover	February 2005	P ≠ NP	Unadjudicated
021	Dr. Viktor V. Ivanov proved that P is not equal to NP.	Dr. Viktor V. Ivanov	March 2005; 2014	P ≠ NP	Unadjudicated
022	Is the Halting problem effectively solvable non-algorithmically, and is the Goedel sentence in NP, but not in P?	Bhupinder Singh Anand	June 2005	P ≠ NP	Unadjudicated
023	Complexity Theory for Simpletons; Complexity science for simpletons	Craig Alan Feinstein	July 2005; July 2006	P ≠ NP	Unadjudicated
024	Proof-sketch: Why NP is not P	Lev Gordeev	Summer 2005	P ≠ NP	Unadjudicated
027	Proving that P is not equal to NP and that P is not equal to the intersection of NP and co-NP	Ron Cohen	November 2005	P ≠ NP	Unadjudicated
030	P =/= NP	Bhupinder Singh Anand	March 2006	P ≠ NP	Unadjudicated
031	A New and Elegant Argument that P is not NP	Craig Alan Feinstein	July 2006	P ≠ NP	Unadjudicated
034	Complexity Considerations, cSAT Lower Bound	Radoslaw Hofman	2006	P ≠ NP	Unadjudicated
036	Using Disentangled States and Algorithmic Information Theory to Solve the P Versus NP Problem	Rubens Ramos Viana	November 2006	P ≠ NP	Unadjudicated
043	P is a proper subset of NP	Jerrald Meek	April 2008	P ≠ NP	Unadjudicated
044	A trivial solution to the PvNP problem	Bhupinder Singh Anand	June 2008	P ≠ NP	Unadjudicated
046	Analysis of the postulates produced by Karp's Theorem	Jerrald Meek	August 2008	P ≠ NP	Unadjudicated
047	On the existence of polynomial-time algorithms to the subset sum problem	Jorma Jormakka	September 2008	P ≠ NP	Unadjudicated
048	P is not equal to NP	Sten-Ake Tarnlund	October 2008; September 2013	P ≠ NP	Unadjudicated
054	Physical portrayal of computational complexity	Arto Annila	June 2009	P ≠ NP	Unadjudicated
055	P != NP Proof	Andre Luiz Barbosa	July 2009	P ≠ NP	Unadjudicated
058	A Possible New Approach to Resolving Open Problems in Computer Science	Ari Blinder	December 2009	P ≠ NP	Adjudicated
062	The Complexity Of The NP-Class	Carlos Barron-Romero	June 2010	P ≠ NP	Unadjudicated
065	P!=NP	Vinay Deolalikar	the beginning of August 2010	P ≠ NP	Unadjudicated
068	A Solution to the P versus NP Problem	Frank Vega Delgado	November 2010	P ≠ NP	Unadjudicated
069	The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P	Carlos Barron-Romero	December 2010	P ≠ NP	Unadjudicated
070	THE ANSWER TO THE P/NP PROBLEM IS P≠NP!	Bangyan Wen, Yi Lin	December 2010	P ≠ NP	Unadjudicated
071	The Complexity of 3SAT_N and the P versus NP Problem	Ruijia Liao	January 2011	P ≠ NP	Unadjudicated
077	On the relationship between classes P and NP; About set-theoretic properties of one-way functions; On the structure of the class NP	Anatoly Plotnikov	September/October 2011	P ≠ NP	Unadjudicated
078	NP is not AL and P is not NC is not NL is not L	Koji Kobayashi	October 2011	P ≠ NP	Unadjudicated
081	Construction of an NP Problem with an Exponential Lower Bound	Roman Yampolskiy	November 2011	P ≠ NP	Unadjudicated
082	The Computational Complexity of the Traveling Salesman Problem	Craig Alan Feinstein	November 2011	P ≠ NP	Unadjudicated
083	Just How Random Are Your Answers?	Jeffrey W. Holcomb	fall 2011	P ≠ NP	Unadjudicated
085	P vs NP	Gilberto Rodrigo Diduch	January 2012	P ≠ NP	Unadjudicated
086	Topological approach to solve P versus NP	Koji Kobayashi	February 2012	P ≠ NP	Unadjudicated
087	The existence of one-way functions; P versus UP	Frank Vega Delgado	February 2012	P ≠ NP	Adjudicated
088	Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity	Minseong Kim	March 2012	P ≠ NP	Unadjudicated
091	Computing Cliques is Intractable	Junichiro Fukuyama	summer 2012; May 2013	P ≠ NP	Unadjudicated
092	Integer factorization and Discrete Logarithm problem are neither in P nor NP-complete; Relationship between circuit complexity and symmetry	Satoshi Tazawa	July 2012	P ≠ NP	Unadjudicated
099	The Lower Border of Complexity of Algorithm of the Elementary NP-Complete Task (The Most Condensed Version)	Rustem Chingizovich Valeyev	August 2013	P ≠ NP	Unadjudicated
104	The P versus NP Problem in Quantum Physics	Daegene Song	February 2014	P ≠ NP	Unadjudicated
105	P not equal NP by modus tollens	Joonmo Kim	March 2014	P ≠ NP	Adjudicated
111	P vs. NP; Is P equal to NP?	Daniel Uribe, Frank Vega	January 2016; February 2016	P ≠ NP	Unadjudicated
112	On Alternation and the Union Theorem	Mathias Hauptmann	February 2016	P ≠ NP	Unadjudicated
114	The Tau One-Way Functions Class: P != NP	Javier A. Arroyo-Figueroa	April 2016	P ≠ NP	Unadjudicated
116	On the Existence of Weak One-Way Functions	Stefan Rass	September 2016	P ≠ NP	Unadjudicated
008	Nicholas Argall proved on 25 March 2003 that P=NP is undecidable.	Nicholas Argall	25 March 2003	Other	Unadjudicated
009	Consequences of an exotic definition for P=NP	N.C.A. da Costa, F.A. Doria	2003	Other	Adjudicated
011	Evidence that P is not equal to NP; P is not equal to NP	Craig Alan Feinstein	2003/04	Other	Adjudicated
035	co-NP Is Equal To NP	Raju Renjit	November 2006	Other	Unadjudicated
072	Computational Complexity on Signed Numbers	Stefan Jaeger	April 2011	Other	Unadjudicated
095	On the principal impossibility to prove P=NP	Natalia L. Malinina	November 2012	Other	Unadjudicated

Post-2016 Register census entries 117–159

These are 43 unadjudicated candidates censused by the Register after Woeginger’s list froze. These entries were not written or kept by Woeginger. Publication records a candidate claim; it is not an endorsement or an adjudication.

Post-2016 Register census entries 117–159
Number	Author(s)	Year	Direction	Status
117	Norbert Blum	2017	P ≠ NP	Unadjudicated candidateA refutation is recorded
118	Mark Inman	2017	P = NP	Unadjudicated candidate
119	Keum-Bae Cho	2018	P ≠ NP	Unadjudicated candidateA refutation is recorded
120	Peter Kopanov	2018	P ≠ NP	Unadjudicated candidate
121	Angelo Raffaele Meo	2018; 2021; 2023	P ≠ NP	Unadjudicated candidate
122	Konstantinos E. Kyritsis	2018–2023	P ≠ NP	Unadjudicated candidateA refutation is recorded
123	Arun Uday	2018	Other	Unadjudicated candidate
124	Jinliang Wang	2018	P = NP	Unadjudicated candidateA refutation is recorded
125	Aizhong Li	2018	P = NP	Unadjudicated candidate
126	Rasoul Ramezanian	2019	Other	Unadjudicated candidate
127	Boyu Sima	2019	P ≠ NP	Unadjudicated candidateA refutation is recorded
128	Tianrong Lin	2020	P ≠ NP	Unadjudicated candidateA refutation is recorded
129	Vasil Penchev	2020	P ≠ NP	Unadjudicated candidate
130	Lev Gordeev	2020–2026	P ≠ NP	Unadjudicated candidateA refutation is recorded
131	Rupert McCallum	2020–2026	P ≠ NP	Unadjudicated candidate
132	Ioannis Avramopoulos	2020–2021	P = NP	Unadjudicated candidate
133	O. V. German	2020	P ≠ NP	Unadjudicated candidate
134	Yaozhi Jiang	2020	P ≠ NP	Unadjudicated candidate
135	Latif Salum	2020–2022	P = NP	Unadjudicated candidate
136	Manoj Kumar	2021	P = NP	Unadjudicated candidateA refutation is recorded
137	Ali Çivril	2021–2026	P ≠ NP	Unadjudicated candidateA refutation is recorded
138	Reiner Czerwinski	2021–2022	P ≠ NP	Unadjudicated candidate
139	Zulfia A. Chotchaeva	2021	P = NP	Unadjudicated candidate
140	Gao Ming	2022–2026	P ≠ NP	Unadjudicated candidate
141	Petar P. Petrov	2022–2024	P = NP	Unadjudicated candidateA refutation is recorded
142	Natalia L. Malinina	2022	P ≠ NP	Unadjudicated candidate
143	Jian-Gang Tang	2022–2024	P ≠ NP	Unadjudicated candidate
144	Akram Louiz	2023	P ≠ NP	Unadjudicated candidate
145	Yang Yanhong	2023	P = NP	Unadjudicated candidate
146	Ke Xu, Guangyan Zhou	2023–2025	P ≠ NP	Unadjudicated candidateA refutation is recorded
147	Frank Vega	2024–2025	P = NP	Unadjudicated candidate
148	Andres Boldori	2024	P ≠ NP	Unadjudicated candidate
149	Zikang Deng	2024–2025	P = NP	Unadjudicated candidateA refutation is recorded
150	Xinyi Zhou	2024	P = NP	Unadjudicated candidate
151	Vassilly Voinov, Meylis Rahmanov	2018–2025	P = NP	Unadjudicated candidate
152	Jesus Manuel Soledad Terrazas	2025	P ≠ NP	Unadjudicated candidate
153	Craig Crabtree	2025	P ≠ NP	Unadjudicated candidate
154	R. Dharmarajan, D. Ramachandran	2025	P ≠ NP	Unadjudicated candidate
155	Delavar Qasemi	2025	P = NP	Unadjudicated candidate
156	Mirzakhmet Syzdykov, Yannick Kardeis	2025	P = NP	Unadjudicated candidate
157	Changryeol Lee	2025–2026	P = NP	Unadjudicated candidate
158	Darren J. Edwards	2025–2026	P ≠ NP	Unadjudicated candidate
159	T. S. Arthanari	2026	P = NP	Unadjudicated candidate