Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | English |
| Published: |
Zenodo
2025
|
| Online Access: | https://doi.org/10.5281/zenodo.15960264 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
P = NP via Constructive Bidirectional Polynomial-Time Reduction Between SAT and Binary Search
by: Aguilera Katayama, Kaoru
Published: (2026)
by: Aguilera Katayama, Kaoru
Published: (2026)
Geometry-Aware Sampling-Based Motion Planning on Riemannian Manifolds
by: Kyaw, Phone Thiha, et al.
Published: (2026)
by: Kyaw, Phone Thiha, et al.
Published: (2026)
A Formal Proof That P ≠ NP via SAT Space Irreducibility
by: Jorge, G. Pardo
Published: (2025)
by: Jorge, G. Pardo
Published: (2025)
Optimal Robust Recourse with $L^p$-Bounded Model Change
by: Kyaw, Phone, et al.
Published: (2025)
by: Kyaw, Phone, et al.
Published: (2025)
A Polynomial Time Algorithm for 3SAT
by: Quigley, Robert
Published: (2024)
by: Quigley, Robert
Published: (2024)
A Complete Conditional Proof that P ≠ NP via the Fractal Geometry of 3‑SAT Solution Spaces
by: Derscariu, Radu-Daniel
Published: (2026)
by: Derscariu, Radu-Daniel
Published: (2026)
A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
by: Jiang, Xinwen, et al.
Published: (2021)
by: Jiang, Xinwen, et al.
Published: (2021)
A Critique of Quigley's "A Polynomial Time Algorithm for 3SAT"
by: DeJesse, Nicholas, et al.
Published: (2025)
by: DeJesse, Nicholas, et al.
Published: (2025)
A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
by: He, Yumeng, et al.
Published: (2024)
by: He, Yumeng, et al.
Published: (2024)
A Polynomial time Algorithm for 3SAT
by: Du, Lizhi
Published: (2010)
by: Du, Lizhi
Published: (2010)
The Synchronization Bridge: A Proof of P=NP
by: Sahai, Adhrit Mohan
Published: (2026)
by: Sahai, Adhrit Mohan
Published: (2026)
Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
by: Bampis, Evripidis, et al.
Published: (2025)
by: Bampis, Evripidis, et al.
Published: (2025)
Greedy Heuristics for Sampling-Based Motion Planning in High-Dimensional State Spaces
by: Kyaw, Phone Thiha, et al.
Published: (2024)
by: Kyaw, Phone Thiha, et al.
Published: (2024)
Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
by: Lee, Changryeol
Published: (2026)
by: Lee, Changryeol
Published: (2026)
Proof of Millennium Theorem "P versus NP"
by: Syzdykov, Mirzakhmet
Published: (2023)
by: Syzdykov, Mirzakhmet
Published: (2023)
An Intrinsic Barrier for Resolving P = NP (2-SAT as Flat, 3-SAT as High-Dimensional Void-Rich)
by: Alasli, M.
Published: (2025)
by: Alasli, M.
Published: (2025)
P ≠ NP: A Proof via Information Flow Complexity
by: Christian Kilpatrick
Published: (2025)
by: Christian Kilpatrick
Published: (2025)
Constructibility and the P versus NP problem
by: Hole, Arne
Published: (2024)
by: Hole, Arne
Published: (2024)
On a double series
by: Maw, Aung Phone
Published: (2025)
by: Maw, Aung Phone
Published: (2025)
Generalization of some of Ramanujan's formulae
by: Maw, Aung Phone
Published: (2024)
by: Maw, Aung Phone
Published: (2024)
Certain products of sums of Lambert series
by: Maw, Aung Phone
Published: (2024)
by: Maw, Aung Phone
Published: (2024)
On q-series identities with multiple sums related to divisor functions
by: Maw, Aung Phone
Published: (2024)
by: Maw, Aung Phone
Published: (2024)
Revisiting an infinitely nested radical
by: Maw, Aung Phone
Published: (2026)
by: Maw, Aung Phone
Published: (2026)
Analytic expressions pertaining to certain arithmetical functions
by: Maw, Aung Phone
Published: (2024)
by: Maw, Aung Phone
Published: (2024)
On certain $q$-multiple sums
by: Maw, Aung Phone
Published: (2024)
by: Maw, Aung Phone
Published: (2024)
Proofs of NP = coNP = PSPACE: Current upgrade
by: Gordeev, Lev, et al.
Published: (2023)
by: Gordeev, Lev, et al.
Published: (2023)
A Polynomial Decision for 3-SAT
by: Weiss, Angela
Published: (2022)
by: Weiss, Angela
Published: (2022)
Outline of a Proof that P <> NP via the Family Collision-Entropy
by: Dmitry, Khanukov
Published: (2025)
by: Dmitry, Khanukov
Published: (2025)
Outline of a Proof that P <> NP via the Family Collision-Entropy
by: Dmitry, Khanukov
Published: (2025)
by: Dmitry, Khanukov
Published: (2025)
NP-complete Problems can be Solved and Verified in Polynomial Time
by: Syzdykov, Mirzakhmet
Published: (2025)
by: Syzdykov, Mirzakhmet
Published: (2025)
The Symmetry Dial: A Physical Origin for the P vs. NP Problem and the Polynomial Hierarchy
by: Babulik, Peter
Published: (2025)
by: Babulik, Peter
Published: (2025)
A New System for Three-Dimensional Tracking of Motile Microorganisms
by: Thar R., Blackburn N. and Kühl M
Published: (2000)
by: Thar R., Blackburn N. and Kühl M
Published: (2000)
New Algorithms for #2-SAT and #3-SAT
by: Peng, Junqiang, et al.
Published: (2025)
by: Peng, Junqiang, et al.
Published: (2025)
Age model of sediment core P7
by: Winn, Kyaw
Published: (2013)
by: Winn, Kyaw
Published: (2013)
P vs NP问题的完整数学证明 Complete Mathematical Proof of the P vs NP Problem
by: ziko
Published: (2025)
by: ziko
Published: (2025)
When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
by: Krebs, Andreas, et al.
Published: (2025)
by: Krebs, Andreas, et al.
Published: (2025)
Polynomial Time Convergence for NP-Complete Problems via Bounded Carry Algebra: A Hierarchical Reduction Algorithm for the Subset Sum Problem
by: 福永, 大河
Published: (2026)
by: 福永, 大河
Published: (2026)
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
by: Feng, Nick, et al.
Published: (2024)
by: Feng, Nick, et al.
Published: (2024)
P=NP
by: Deng, Zikang
Published: (2024)
by: Deng, Zikang
Published: (2024)
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
by: Janičić, Predrag
Published: (2025)
by: Janičić, Predrag
Published: (2025)