:: Library Catalog

Saved in:

Bibliographic Details
Main Author:	Kayibi, Koko-Kalambay Kalafan
Format:	Preprint
Published:	2018
Subjects:	Computational Complexity
Online Access:	https://arxiv.org/abs/1802.03028
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Information Accessibility Limits in Structured NP Search
by: Wei, Jing-Yuan
Published: (2026)

Limits of structures and Total NP Search Problems
by: Ježil, Ondřej
Published: (2023)

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

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

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

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

Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
by: Çivril, Ali
Published: (2021)

The 2-Attractor Problem is NP-Complete
by: Fuchs, Janosch, et al.
Published: (2023)

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

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

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
by: Grüne, Christoph, et al.
Published: (2026)

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

NP-Hardness and a PTAS for the Pinwheel Problem
by: Kleinberg, Robert, et al.
Published: (2026)

King Chasing Problem in Chinese Chess is NP-hard
by: Li, Chao, et al.
Published: (2026)

Towards Solving NP-Complete and Other Hard Problems Efficiently in Practice
by: Digulescu, Mircea-Adrian
Published: (2026)

A Brief Note on a Recent Claim About NP-Hard Problems and BQP
by: Chavrimootoo, Michael C.
Published: (2024)

The $\text{FP}^\text{NP}$ versus #P dichotomy for #EO
by: Meng, Boning, et al.
Published: (2025)

A Critique of Chen's "The 2-MAXSAT Problem Can Be Solved in Polynomial Time"
by: Le, Tran Duy Anh, et al.
Published: (2024)

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

Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$
by: Çivril, Ali
Published: (2021)

Computing the EHZ capacity is NP-hard
by: Leipold, Karla, et al.
Published: (2024)

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

BQP, meet NP: Search-to-decision reductions and approximate counting
by: Gharibian, Sevag, et al.
Published: (2024)

Exploring the Reductions Between SSP-NP-complete Problems and Developing a Compendium Website Displaying the Results
by: Pfaue, Femke
Published: (2024)

Intrinsic Information Flow in Structureless NP Search
by: Wei, Jing-Yuan
Published: (2026)

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

On $NP \cap coNP$ proof complexity generators
by: Krajicek, Jan
Published: (2025)

Wataridori is NP-Complete
by: Ruangwises, Suthee
Published: (2026)

Nondango is NP-Complete
by: Ruangwises, Suthee
Published: (2023)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
by: Nederlof, Jesper
Published: (2026)

A Critique of Lin's "On $\text{NP}$ versus $\text{coNP}$ and Frege Systems"
by: DeJesse, Nicholas, et al.
Published: (2025)

A Schematic Definition of Quantum Polynomial Time Computability
by: Yamakami, Tomoyuki
Published: (2018)

BusOut is NP-complete
by: Ishibashi, Takehiro, et al.
Published: (2025)

Communication Complexity is NP-hard
by: Hirahara, Shuichi, et al.
Published: (2025)

On Kernelization with Access to NP-Oracles
by: Molter, Hendrik, et al.
Published: (2025)

Computing the Elementary Symmetric Polynomials in Positive Characteristics
by: Orzel, Ian
Published: (2025)

On Computability of Computable Problems
by: Khaliq, Asad
Published: (2023)

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

NP-Completeness of Neighborhood Balanced Colorings
by: Asaeedi, Saeed
Published: (2024)

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
by: Vu, Thi Xuan
Published: (2025)