Notable P vs. NP proof attempts.

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.

Formal verification of the logical incompatibility between the P=NP hypothesis and the Witten-Helffer-Sjöstrand tunneling theorems in spectral geometry. Implemented in Lean 4.

python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time

A comprehensive Python framework for parsing, transforming, and benchmarking CNF files for SAT solving research.

Unity Equilibrium Theory (UET)

Labs for the Advanced Algorithms course

P != NP

Terminal obstruction (Cyclone) for locality-bounded computation: overlap-rank BOM, AKR CPD₁ kernel, entropy-depth lower bounds, and Lean formalization toward P≠NP.

Novel mathematical framework connecting P vs NP to the golden ratio phi via witness space geometry. Part of the unified E8/H4/phi theory.

Reframing the P vs NP Problem

Lokale xLSTM-Strukturverarbeitung (atomar/molekular) – KI & Komplexität P ≠ NP

Código del TFG de Ingeniería Informática / Code for the Computer Science Bacherlor's Thesis

cNP-TSP — Resonance-Guided Fixed-Point Solver

An structured attempt at a Polynomial -Time Solution to the NP-complete Subset Sum Problem.

Informational Repo covering the Satisfiability of formulas in 3 Conjunctive Normal Form. Includes Demos of solving algorithms, and detailed analysis.

Structural analyses of 11 Millennium-Class challenges (01/30/2026). Using the XYAKANYAA System, the repository documents how expanded observational context yields harmonic stabilization. Experimental, reproducible, and open to refutation.

Unified experimental framework for computational exploration of the Clay Millennium Problems with reproducible pipelines and modular research infrastructure.

All assignments for CS 218: Design and Analysis of Algorithms, Spring 2021, IIT Bombay

COSS-IS-SAT: A Polynomial-Time Algorithm for SAT problem and a Proof of P=NP

The Sabag Bounded Transformation Principle: P=NP=PSPACE=BQP for bounded local moves. Six Millennium Prize Problems attacked - five dissolved.

Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.