Copertina

NP-complete Problems can be Solved and Verified in Polynomial Time

Fuente: Zenodo

Salvato in:

Dettagli Bibliografici
Autore principale:	Syzdykov, Mirzakhmet
Natura:	Recurso digital
Pubblicazione:	Zenodo 2025
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Proof of Millennium Theorem "P versus NP"
di: Syzdykov, Mirzakhmet
Pubblicazione: (2023)

Generalization and Relation of Probabilistic Models to Finite Automata
di: Syzdykov, Mirzakhmet
Pubblicazione: (2025)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
di: Lee, Changryeol
Pubblicazione: (2026)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
di: Jiang, Xinwen, et al.
Pubblicazione: (2021)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
di: Bampis, Evripidis, et al.
Pubblicazione: (2025)

Unitary Closed Timelike Curves can Solve all of NP
di: Shmueli, Omri
Pubblicazione: (2024)

Graph-Based Deterministic Polynomial Framwork for NP Problems
di: Lee, Changryeol
Pubblicazione: (2025)

NP-Engine: Empowering Optimization Reasoning in Large Language Models with Verifiable Synthetic NP Problems
di: Li, Xiaozhe, et al.
Pubblicazione: (2025)

Quantum Feasibility Labeling for NP-complete Vertex Coloring Problem
di: Zhan, Junpeng
Pubblicazione: (2023)

Evolomino is NP-complete
di: Nikolaev, Andrei V.
Pubblicazione: (2025)

System and Method for Deterministic Polynomial-Time Graph Optimization and NP Problem Reduction Patent Description
di: Gillis, John Archie
Pubblicazione: (2025)

DNA Probe Computing System for Solving NP-Complete Problems
di: Xu, Jin, et al.
Pubblicazione: (2025)

Potential for Polynomial Solution for NP-Complete Problems using Quantum Computation
di: Badihian, Neema Rustin
Pubblicazione: (2025)

BusOut is NP-complete
di: Ishibashi, Takehiro, et al.
Pubblicazione: (2025)

Broadcast Graph Is NP-complete
di: Xu, Jinghan, et al.
Pubblicazione: (2024)

Towards Solving NP-Complete and Other Hard Problems Efficiently in Practice
di: Digulescu, Mircea-Adrian
Pubblicazione: (2026)

A Polynomial-Time Heuristic for the Travelling Salesman Problem Verified Against Held-Karp
di: Aggarwal, Minakshi
Pubblicazione: (2025)

Polynomial Time Convergence for NP-Complete Problems via Bounded Carry Algebra: A Hierarchical Reduction Algorithm for the Subset Sum Problem
di: 福永, 大河
Pubblicazione: (2026)

Solving Multi-Agent Multi-Goal Path Finding Problems in Polynomial Time
di: Edelkamp, Stefan
Pubblicazione: (2025)

A Critique of Chen's "The 2-MAXSAT Problem Can Be Solved in Polynomial Time"
di: Le, Tran Duy Anh, et al.
Pubblicazione: (2024)

Solving Sharp Bounded-error Quantum Polynomial Time Problem by Evolution methods
di: Guo, Zhen, et al.
Pubblicazione: (2024)

A Polynomial-Time Algorithm for SAT: Constructive Proof that P = NP
di: Kyaw, Kyaw Phone Thar
Pubblicazione: (2025)

Mim-Width is paraNP-complete
di: Bergougnoux, Benjamin, et al.
Pubblicazione: (2025)

The Symmetry Dial: A Physical Origin for the P vs. NP Problem and the Polynomial Hierarchy
di: Babulik, Peter
Pubblicazione: (2025)

Solve-Detect-Verify: Inference-Time Scaling with Flexible Generative Verifier
di: Zhong, Jianyuan, et al.
Pubblicazione: (2025)

There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \not= NP$
di: Kayibi, Koko-Kalambay Kalafan
Pubblicazione: (2018)

Finding forest-orderings of tournaments is NP-complete
di: Aboulker, Pierre, et al.
Pubblicazione: (2024)

Finding the disjointness of stabilizer codes is NP-complete
di: Bostanci, John, et al.
Pubblicazione: (2021)

The n-vehicle exploration problem is NP-complete
di: Cui, Jinchuan, et al.
Pubblicazione: (2023)

Calibrated Reasoning: An Explanatory Verifier for Dynamic and Efficient Problem-Solving
di: Garg, Anisha, et al.
Pubblicazione: (2025)

A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
di: Janičić, Predrag
Pubblicazione: (2025)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
di: Tayal, Mumuksh
Pubblicazione: (2025)

When To Solve, When To Verify: Compute-Optimal Problem Solving and Generative Verification for LLM Reasoning
di: Singhi, Nishad, et al.
Pubblicazione: (2025)

Exploring the Reductions Between SSP-NP-complete Problems and Developing a Compendium Website Displaying the Results
di: Pfaue, Femke
Pubblicazione: (2024)

Weighted Treedepth is NP-complete on Graphs of Bounded Degree
di: Dirks, Jona, et al.
Pubblicazione: (2025)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
di: Hellmuth, Marc, et al.
Pubblicazione: (2023)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
di: Foucaud, Florent, et al.
Pubblicazione: (2023)

Towards Verified Polynomial Factorisation
di: Davenport, James H.
Pubblicazione: (2024)

P = NP via Constructive Bidirectional Polynomial-Time Reduction Between SAT and Binary Search
di: Aguilera Katayama, Kaoru
Pubblicazione: (2026)

The Quiver Problem is NP Complete
di: Kac, Victor, et al.
Pubblicazione: (2025)