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
P = NP via Constructive Bidirectional Polynomial-Time Reduction Between SAT and Binary Search
P = NP via Constructive Bidirectional Polynomial-Time Reduction Between SAT and Binary Search
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Aguilera Katayama, Kaoru
Format:
Recurso digital
Published:
Zenodo
2026
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
A Polynomial-Time Algorithm for SAT: Constructive Proof that P = NP
by: Kyaw, Kyaw Phone Thar
Published: (2025)
Fin de las Matematicas
by: Aguilera Katayama, Kaoru
Published: (2026)
Science is Subjective: Humans Are Incapable of Knowing or Discovering Absolute Truth
by: Aguilera Katayama, Kaoru
Published: (2026)
Kaoru Pairs A Novel Parallel Readout Architecture via Software-Level Transistor Grouping
by: יהוה, et al.
Published: (2026)
Russell's Paradox and the End of All Mathematics: A Formal Proof of Total Inconsistency in Naive Set Theory and the Irreversibility of Foundational Collapse
by: Aguilera Katayama, Kaoru, et al.
Published: (2026)
