:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Dmitry, Khanukov
Format:	Recurso digital
Language:	English
Published:	Zenodo 2025
Online Access:	https://doi.org/10.5281/zenodo.17200765
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Outline of a Proof that P <> NP via the Family Collision-Entropy
by: Dmitry, Khanukov
Published: (2025)

The Synchronization Bridge: A Proof of P=NP
by: Sahai, Adhrit Mohan
Published: (2026)

P ≠ NP: A Proof via Information Flow Complexity
by: Christian Kilpatrick
Published: (2025)

Proof of Millennium Theorem "P versus NP"
by: Syzdykov, Mirzakhmet
Published: (2023)

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

Property-Based Testing by Elaborating Proof Outlines
by: Miller, Dale, et al.
Published: (2024)

Proofs of NP = coNP = PSPACE: Current upgrade
by: Gordeev, Lev, et al.
Published: (2023)

A Polynomial-Time Algorithm for SAT: Constructive Proof that P = NP
by: Kyaw, Kyaw Phone Thar
Published: (2025)

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

P vs NP问题的完整数学证明 Complete Mathematical Proof of the P vs NP Problem
by: ziko
Published: (2025)

Multi‐Objective Route Outlining and Collision Avoidance of Multiple Humanoid Robots in a Cluttered Environment
by: Abhishek Kumar Kashyap, et al.
Published: (2024)

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

Resolution of P ̸= NP: Compression Barriers, Non-Relativizing Arguments, and Entropy Formalization
by: Fisher, Christopher
Published: (2025)

Resolution of P ̸= NP: Compression Barriers, Non-Relativizing Arguments, and Entropy Formalization
by: Fisher, Christopher
Published: (2025)

A Complete Conditional Proof that P ≠ NP via 1RSB Condensation, the Black Hole Trilemma, and the Reduction Conjecture
by: Derscariu, Radu-Daniel
Published: (2026)

NP-Completeness Proofs of Puzzles using the T-Metacell Framework
by: Kiatchaipipat, Nattapol, et al.
Published: (2025)

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
by: Ruangwises, Suthee
Published: (2024)

Outlines
Published: (2022)

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

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

P not equal to NP
by: Delgado, Daniel Cardona
Published: (2023)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
by: Otsuji, Taisei, et al.
Published: (2026)

P vs NP via Ising Energy Landscapes
by: Daugherty, Bryan, et al.
Published: (2026)

An Outline of Romanticism in the West
by: Isbell, John Claiborne
Published: (2022)

An Outline of the Origins of Money
by: Schurtz, Heinrich
Published: (2024)

Outline of Dani Morphology
by: van der Stap, P.
Published: (2016)

The Observer in P vs NP
by: Turishchev, Alexander
Published: (2026)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

A proof of P!=NP
by: McCallum, Rupert
Published: (2020)

Integer Linear-Exponential Programming in NP by Quantifier Elimination
by: Chistikov, Dmitry, et al.
Published: (2024)

Outlines of Biochemistry / Eric E. Conn, P. K. Stumpf
by: Conn, Eric E

Abel's Revenge: The Death of P = NP
by: Eva, Moss
Published: (2026)

Formal Proof of the Riemann Hypothesis via Entropy Geometry
by: Elliott, Andrew, et al.
Published: (2025)

PhalangesOutlinesCorrect
by: TSML Archive Maintainers
Published: (2018)

A Critique of Deng's "P=NP"
by: Humphreys, Isabel, et al.
Published: (2025)

Posible prueba de P ≠ NP
by: Salazar Molina, Andy Ariel
Published: (2026)

Markets are competitive if and only if P != NP
by: Maymin, Philip Z.
Published: (2026)

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

Topological Collapse: P = NP Implies #P = FP via Solution-Space Homology
by: Alasli, M.
Published: (2026)

Some conditions implying if P=NP then P=PSPACE
by: Rodriguez, Ismael
Published: (2026)