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
System and Method for Deterministic Polynomial-Time Graph Optimization and NP Problem Reduction Patent Description
System and Method for Deterministic Polynomial-Time Graph Optimization and NP Problem Reduction Patent Description
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Gillis, John Archie
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
Be the first to leave a comment!
Your Comment
You must be logged in first
Similar Items
Graph-Based Deterministic Polynomial Framwork for NP Problems
by: Lee, Changryeol
Published: (2025)
A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
by: Jiang, Xinwen, et al.
Published: (2021)
NP-complete Problems can be Solved and Verified in Polynomial Time
by: Syzdykov, Mirzakhmet
Published: (2025)
Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
by: Bampis, Evripidis, et al.
Published: (2025)
Polynomial Time Convergence for NP-Complete Problems via Bounded Carry Algebra: A Hierarchical Reduction Algorithm for the Subset Sum Problem
by: 福永, 大河
Published: (2026)