Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
NP-complete Problems can be Solved and Verified in Polynomial Time
NP-complete Problems can be Solved and Verified in Polynomial Time
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Syzdykov, Mirzakhmet
Format:
Recurso digital
Published:
Zenodo
2025
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Internet
https://doi.org/10.5281/zenodo.17267018
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)