A Direct Coordinate-Propagation Algorithm for

Every local Boolean assignment is represented by a normalized</p><p dir="ltr">deficit coordinate, and every clause excludes exactly its unique complementary coordinate on</p><p dir="ltr">its own support. Neighboring cells communicate through shared coordinate interfaces.

The</p><p dir="ltr">defining restriction is functional connectivity: an admissible signature of one cell has at most one</p><p dir="ltr">compatible signature in an adjacent cell. For a connected instance with at most k admissible</p><p dir="ltr">signatures per cell and support size at most d, satisfiability is decided by direct propagation</p><p dir="ltr">from at most k root signatures.</p>