P versus NP Computational Study Archive: Reproducible Experiments and Theoretical Notes

An educational computational study archive for the P versus NP problem. It contains reproducible finite experiments on satisfiability, tested classical reductions, and theoretical notes sourced to primary literature. It does not prove P equals NP or P does not equal NP, and makes no claim about the resolution of the problem, which remains open.