:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Syzdykov, Mirzakhmet
Format:	Recurso digital
Language:
Published:	Zenodo 2025
Online Access:	https://doi.org/10.5281/zenodo.17267018
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Proof of Millennium Theorem "P versus NP"
by: Syzdykov, Mirzakhmet
Published: (2023)

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

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

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

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

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

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

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

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

Evolomino is NP-complete
by: Nikolaev, Andrei V.
Published: (2025)

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

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

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

BusOut is NP-complete
by: Ishibashi, Takehiro, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Towards Verified Polynomial Factorisation
by: Davenport, James H.
Published: (2024)

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

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