Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
February 6, 2026Open Access

Irreducible Global Dependencies, Structural Exposure, and a Conditional Separation Framework for P versus NP

View Full Paper
Ask AI
Bookmark
Share

Authors

MAMichael Arias

Discussion

Loading...

Member takes

Implication

Demonstrates a structural separation of P from NP using global dependencies in computational constraints, suggesting new insights.

Key Points

  • To develop a framework that distinguishes P from NP via structural exposure and global dependencies in computation.
  • Introduced a quantitative notion of global non-local dependency using localization radius.
  • Constructed explicit NP-complete SAT formulas by amplifying EXACTLY-ONE surface constraints.
  • Isolated a minimal structural exposure axiom (M2) to analyze computational inconsistencies.
  • Formulas constructed yield superpolynomial families of independent global cycles.
  • Under the M2 axiom, deterministic polynomial-time computation cannot resolve inconsistency without bounded local accumulation.
  • The framework clearly separates P from NP based on a structural hypothesis.

Cite This Study

Michael Arias (2026) studied this question.

synapsesocial.com/papers/698585678f7c464f23008c57https://doi.org/10.5281/zenodo.18483321
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Global Dependence, Reductions, and Semantic Fragmentation in NP-Complete Problems2026
  2. 2Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse2025
  3. 3Structural and Topological Complexity of 3-SAT Constraint Systems: From Local Contradictions to Unavoidable Computational Information2026
  4. 4Informational Filtrations, Global Dependencies, and the Structural Boundary of Deterministic Polynomial-Time Computation2026
  5. 5Separation of P and NP2025