A Structured Polynomial-Time Attempt at solving the Subset Sum Problem and its Implications for P vs NP

This project presents a structured, polynomial-time approach to the classical NP-complete Subset Sum problem. By using deterministic anchoring and strict polynomial constraints, this framework avoids exponential branching while retaining completeness. The solution has been implemented in Python and verified through logical and numerical test cases. The accompanying documentation, source code, and LaTeX manuscript discuss implications for P vs NP and invite scholarly review and discussion.