P = NP via Constructive Bidirectional Polynomial-Time Reduction Between SAT and Binary Search

View at publisher Summarise with VIRAT
Authors: Kaoru Aguilera Katayama
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Fields of Study & Subjects

Complexity and Algorithms in Graphs Advanced Graph Theory Research Computability Logic AI Algorithms

Publication details

Publication date
1 January 2026
Language
EN