:: Library Catalog

Bearbmagovva

Furkejuvvon:

Bibliográfalaš dieđut
Váldodahkki:	Syzdykov, Mirzakhmet
Materiálatiipa:	Recurso digital
Giella:
Almmustuhtton:	Zenodo 2025
Liŋkkat:	https://doi.org/10.5281/zenodo.17267018
Fáddágilkorat:	Lasit fáddágilkoriid Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!

Geahča maid

Proof of Millennium Theorem "P versus NP"
Dahkki: Syzdykov, Mirzakhmet
Almmustuhtton: (2023)

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

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

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

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

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

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

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

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

Evolomino is NP-complete
Dahkki: Nikolaev, Andrei V.
Almmustuhtton: (2025)

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

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

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

BusOut is NP-complete
Dahkki: Ishibashi, Takehiro, et al.
Almmustuhtton: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Towards Verified Polynomial Factorisation
Dahkki: Davenport, James H.
Almmustuhtton: (2024)

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

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