pvsnp

Literature review year 4

Research UOFDT math

An Approximate Solution to the Minimum Vertex Cover Problem: The Hvala Algorithm

Formalizing the A5 Universal Barrier in P vs NP via Group-Theoretic Semantics

Unified repository for Spectral Complexity Theory — papers, tools, datasets, and the visualization platform for analyzing problem solvability and logical structure.

This repository presents a constructive and complete proof of the P≠NP problem, based on structural separation and recursive unconstructibility. 本リポジトリは、構成的手法によりP≠NP問題を完全に証明した理論を収録しています。構成不能性と分離構造に基づく新たなアプローチです。

Siriaisa: Approximate Independent Dominating Set Solver

Computes the polynomial hierarchy equivalent of an input.

A Computational Investigation into Emergent Constraint Entanglement

3SAT solver and integer factorizer. US nonprovisional utility patent pending application #19/439,377. Visit page at link below for licensing inquiries.