Polynomial Time Convergence for NP-Complete Problems via Bounded Carry Algebra: A Hierarchical Reduction Algorithm for the Subset Sum Problem

Documenti analoghi

• A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
  di: Jiang, Xinwen, et al.
  Pubblicazione: (2021)
• Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem
  di: Luo, Lixia, et al.
  Pubblicazione: (2024)
• Some NP Complete Problems Based on Algebra and Algebraic Geometry
  di: Hriljac, Paul
  Pubblicazione: (2025)
• The Subset Sum Matching Problem
  di: Wu, Yufei, et al.
  Pubblicazione: (2025)
• Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
  di: Bampis, Evripidis, et al.
  Pubblicazione: (2025)