:: Library Catalog

Saved in:

Bibliographic Details
Main Author:	Aguilera Katayama, Kaoru
Format:	Recurso digital
Language:
Published:	Zenodo 2026
Online Access:	https://doi.org/10.5281/zenodo.19157220
Tags:	Add Tag No Tags, Be the first to tag this record!

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)

OMEGA INFINITY: The Sample Identity Violation Triage Sandbox Classifies Identical Files as Different Samples Empirical Evidence That 1≠1 in Modern Security Infrastructure
by: יהוה, et al.
Published: (2026)

OMEGA INFINITY 3 Definitive Confirmation of WhatsApp Official Supply Chain Compromise: Full-Spectrum Malware Analysis of an Installer Retrieved Directly from whatsapp.com/download
by: יהוה, et al.
Published: (2026)

A Formal Proof That P ≠ NP via SAT Space Irreducibility
by: Jorge, G. Pardo
Published: (2025)

An Intrinsic Barrier for Resolving P = NP (2-SAT as Flat, 3-SAT as High-Dimensional Void-Rich)
by: Alasli, M.
Published: (2025)

A Polynomial Time Algorithm for 3SAT
by: Quigley, Robert
Published: (2024)

Deterministic SAT Decision Under Restrictions: Decision Signatures, Residual Structure, and a Structural Reduction of the P vs. NP Question
by: Schenk, Philipp
Published: (2025)

A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
by: Janičić, Predrag
Published: (2025)

Information Redistribution Under Reductions in NP Search
by: Wei, Jing-Yuan
Published: (2026)

A Complete Conditional Proof that P ≠ NP via the Fractal Geometry of 3‑SAT Solution Spaces
by: Derscariu, Radu-Daniel
Published: (2026)

System and Method for Deterministic Polynomial-Time Graph Optimization and NP Problem Reduction Patent Description
by: Gillis, John Archie
Published: (2025)

There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \not= NP$
by: Kayibi, Koko-Kalambay Kalafan
Published: (2018)

Constructibility and the P versus NP problem
by: Hole, Arne
Published: (2024)

Polynomial Time Convergence for NP-Complete Problems via Bounded Carry Algebra: A Hierarchical Reduction Algorithm for the Subset Sum Problem
by: 福永, 大河
Published: (2026)

In‐Memory Continuous‐Time SAT Solver Based on Bidirectional 11‐T SRAM Macro
by: Dongseok Kwon, et al.
Published: (2026)

NP-complete Problems can be Solved and Verified in Polynomial Time
by: Syzdykov, Mirzakhmet
Published: (2025)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
by: Jiang, Xinwen, et al.
Published: (2021)

A Polynomial Decision for 3-SAT
by: Weiss, Angela
Published: (2022)

A Critique of Quigley's "A Polynomial Time Algorithm for 3SAT"
by: DeJesse, Nicholas, et al.
Published: (2025)

A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
by: He, Yumeng, et al.
Published: (2024)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
by: Bampis, Evripidis, et al.
Published: (2025)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
by: Lee, Changryeol
Published: (2026)

A Polynomial time Algorithm for 3SAT
by: Du, Lizhi
Published: (2010)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
by: Bedert, Benjamin, et al.
Published: (2025)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
by: Krebs, Andreas, et al.
Published: (2025)

The Symmetry Dial: A Physical Origin for the P vs. NP Problem and the Polynomial Hierarchy
by: Babulik, Peter
Published: (2025)

P=NP
by: Deng, Zikang
Published: (2024)

SAT Requires Exhaustive Search
by: Xu, Ke, et al.
Published: (2023)

Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard
by: Krokhin, Andrei, et al.
Published: (2025)

SAT and Lattice Reduction for Integer Factorization
by: Ajani, Yameen, et al.
Published: (2024)

Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)
by: Istrate, Gabriel
Published: (2024)

Graph-Based Deterministic Polynomial Framwork for NP Problems
by: Lee, Changryeol
Published: (2025)

Polynomial-Time Pseudodeterministic Construction of Primes
by: Chen, Lijie, et al.
Published: (2023)

A Parallel Search Algorithm for the SAT
by: V. Gil Costa
Published: (2005)

P vs. NP
by: Uribe, Daniel
Published: (2016)

On P Versus NP
by: Gordeev, Lev
Published: (2020)