A Deterministic Polynomial-Time Algorithm for Subset Sum with Full Integer Support

A deterministic, polynomial-time algorithm for the classical Subset Sum problem over the full range of signed integers. The method avoids backtracking, dynamic programming, or pseudo-polynomial recursion. It uses structured anchoring and filtration to explore candidate sets without exponential blowup. The algorithm supports negative and large values and is tested on inputs up to ten million elements, showing consistent polynomial behavior in time and space