:: Library Catalog

Нүүр зураг

-д хадгалсан:

Номзүйн дэлгэрэнгүй
Үндсэн зохиолч:	Kyaw, Kyaw Phone Thar
Формат:	Recurso digital
Хэл сонгох:	англи
Хэвлэсэн:	Zenodo 2025
Онлайн хандалт:	https://doi.org/10.5281/zenodo.15960264
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!

Ижил төстэй зүйлс

P = NP via Constructive Bidirectional Polynomial-Time Reduction Between SAT and Binary Search
-н: Aguilera Katayama, Kaoru
Хэвлэсэн: (2026)

Geometry-Aware Sampling-Based Motion Planning on Riemannian Manifolds
-н: Kyaw, Phone Thiha, зэрэг
Хэвлэсэн: (2026)

A Formal Proof That P ≠ NP via SAT Space Irreducibility
-н: Jorge, G. Pardo
Хэвлэсэн: (2025)

Optimal Robust Recourse with $L^p$-Bounded Model Change
-н: Kyaw, Phone, зэрэг
Хэвлэсэн: (2025)

A Polynomial Time Algorithm for 3SAT
-н: Quigley, Robert
Хэвлэсэн: (2024)

A Complete Conditional Proof that P ≠ NP via the Fractal Geometry of 3‑SAT Solution Spaces
-н: Derscariu, Radu-Daniel
Хэвлэсэн: (2026)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
-н: Jiang, Xinwen, зэрэг
Хэвлэсэн: (2021)

A Critique of Quigley's "A Polynomial Time Algorithm for 3SAT"
-н: DeJesse, Nicholas, зэрэг
Хэвлэсэн: (2025)

A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
-н: He, Yumeng, зэрэг
Хэвлэсэн: (2024)

A Polynomial time Algorithm for 3SAT
-н: Du, Lizhi
Хэвлэсэн: (2010)

The Synchronization Bridge: A Proof of P=NP
-н: Sahai, Adhrit Mohan
Хэвлэсэн: (2026)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
-н: Bampis, Evripidis, зэрэг
Хэвлэсэн: (2025)

Greedy Heuristics for Sampling-Based Motion Planning in High-Dimensional State Spaces
-н: Kyaw, Phone Thiha, зэрэг
Хэвлэсэн: (2024)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
-н: Lee, Changryeol
Хэвлэсэн: (2026)

Proof of Millennium Theorem "P versus NP"
-н: Syzdykov, Mirzakhmet
Хэвлэсэн: (2023)

An Intrinsic Barrier for Resolving P = NP (2-SAT as Flat, 3-SAT as High-Dimensional Void-Rich)
-н: Alasli, M.
Хэвлэсэн: (2025)

P ≠ NP: A Proof via Information Flow Complexity
-н: Christian Kilpatrick
Хэвлэсэн: (2025)

Constructibility and the P versus NP problem
-н: Hole, Arne
Хэвлэсэн: (2024)

On a double series
-н: Maw, Aung Phone
Хэвлэсэн: (2025)

Generalization of some of Ramanujan's formulae
-н: Maw, Aung Phone
Хэвлэсэн: (2024)

Certain products of sums of Lambert series
-н: Maw, Aung Phone
Хэвлэсэн: (2024)

On q-series identities with multiple sums related to divisor functions
-н: Maw, Aung Phone
Хэвлэсэн: (2024)

Revisiting an infinitely nested radical
-н: Maw, Aung Phone
Хэвлэсэн: (2026)

Analytic expressions pertaining to certain arithmetical functions
-н: Maw, Aung Phone
Хэвлэсэн: (2024)

On certain $q$-multiple sums
-н: Maw, Aung Phone
Хэвлэсэн: (2024)

Proofs of NP = coNP = PSPACE: Current upgrade
-н: Gordeev, Lev, зэрэг
Хэвлэсэн: (2023)

A Polynomial Decision for 3-SAT
-н: Weiss, Angela
Хэвлэсэн: (2022)

Outline of a Proof that P <> NP via the Family Collision-Entropy
-н: Dmitry, Khanukov
Хэвлэсэн: (2025)

Outline of a Proof that P <> NP via the Family Collision-Entropy
-н: Dmitry, Khanukov
Хэвлэсэн: (2025)

NP-complete Problems can be Solved and Verified in Polynomial Time
-н: Syzdykov, Mirzakhmet
Хэвлэсэн: (2025)

The Symmetry Dial: A Physical Origin for the P vs. NP Problem and the Polynomial Hierarchy
-н: Babulik, Peter
Хэвлэсэн: (2025)

A New System for Three-Dimensional Tracking of Motile Microorganisms
-н: Thar R., Blackburn N. and Kühl M
Хэвлэсэн: (2000)

New Algorithms for #2-SAT and #3-SAT
-н: Peng, Junqiang, зэрэг
Хэвлэсэн: (2025)

Age model of sediment core P7
-н: Winn, Kyaw
Хэвлэсэн: (2013)

P vs NP问题的完整数学证明 Complete Mathematical Proof of the P vs NP Problem
-н: ziko
Хэвлэсэн: (2025)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
-н: Krebs, Andreas, зэрэг
Хэвлэсэн: (2025)

Polynomial Time Convergence for NP-Complete Problems via Bounded Carry Algebra: A Hierarchical Reduction Algorithm for the Subset Sum Problem
-н: 福永, 大河
Хэвлэсэн: (2026)

DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
-н: Feng, Nick, зэрэг
Хэвлэсэн: (2024)

P=NP
-н: Deng, Zikang
Хэвлэсэн: (2024)

A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
-н: Janičić, Predrag
Хэвлэсэн: (2025)