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
A Polynomial-Time Algorithm for SAT: Constructive Proof that P = NP
A Polynomial-Time Algorithm for SAT: Constructive Proof that P = NP
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Kyaw, Kyaw Phone Thar
Format:
Recurso digital
Language:
English
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
P = NP via Constructive Bidirectional Polynomial-Time Reduction Between SAT and Binary Search
by: Aguilera Katayama, Kaoru
Published: (2026)
A Formal Proof That P ≠ NP via SAT Space Irreducibility
by: Jorge, G. Pardo
Published: (2025)
Geometry-Aware Sampling-Based Motion Planning on Riemannian Manifolds
by: Kyaw, Phone Thiha, et al.
Published: (2026)
Optimal Robust Recourse with $L^p$-Bounded Model Change
by: Kyaw, Phone, et al.
Published: (2025)
A Polynomial Time Algorithm for 3SAT
by: Quigley, Robert
Published: (2024)
