Tootfinder

Structural Separation and Semantic Incompatibility in the P vs. NP Problem: Computational Complexity Analysis with Construction Defining Functionality
Yumiko Nishiyama
https://arxiv.org/abs/2509.22995 …

Structural Separation and Semantic Incompatibility in the P vs. NP Problem: Computational Complexity Analysis with Construction Defining Functionality
The Boolean satisfiability problem (SAT) holds a central place in computational complexity theory as the first shown NP-complete problem. Due to this role, SAT is often used as the benchmark for polynomial-time reductions: if a problem can be reduced to SAT, it is at least as hard as SAT, and hence considered NP-complete. However, the CDF framework offers a structural inversion of this traditional view. Rather than treating SAT as merely a representative of NP-completeness, we investigate wheth…

Crosslisted article(s) found for cs.CC. https://arxiv.org/list/cs.CC/new
[1/1]:
- Structural Separation and Semantic Incompatibility in the P vs. NP Problem: Computational Complex...
Yumiko Nishiyama