:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fuchs, Janosch, Whittington, Philip
Format:	Preprint
Publié:	2023
Sujets:	Computational Complexity
Accès en ligne:	https://arxiv.org/abs/2304.06523
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Nondango is NP-Complete
par: Ruangwises, Suthee
Publié: (2023)

Wataridori is NP-Complete
par: Ruangwises, Suthee
Publié: (2026)

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

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
par: Nederlof, Jesper
Publié: (2026)

NP-Completeness of Neighborhood Balanced Colorings
par: Asaeedi, Saeed
Publié: (2024)

NP-Completeness of Multicast Beamforming in Wireless Communication
par: Shrestha, Sagar
Publié: (2025)

An Oracle with no $\mathrm{UP}$-Complete Sets, but $\mathrm{NP}=\mathrm{PSPACE}$
par: Dingel, David, et autres
Publié: (2024)

Recognizing Sumsets is NP-Complete
par: Abboud, Amir, et autres
Publié: (2024)

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
par: Ruangwises, Suthee
Publié: (2024)

Limits of structures and Total NP Search Problems
par: Ježil, Ondřej
Publié: (2023)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
par: Otsuji, Taisei, et autres
Publié: (2026)

King Chasing Problem in Chinese Chess is NP-hard
par: Li, Chao, et autres
Publié: (2026)

NP-Completeness Proofs of Puzzles using the T-Metacell Framework
par: Kiatchaipipat, Nattapol, et autres
Publié: (2025)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
par: Grüne, Christoph, et autres
Publié: (2026)

The Complexity of Graph Exploration Games
par: Fuchs, Janosch, et autres
Publié: (2023)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
par: Fairbairn, David L., et autres
Publié: (2024)

Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464
par: Minevich, Igor, et autres
Publié: (2024)

P=NP
par: Deng, Zikang
Publié: (2024)

NP-Hardness and a PTAS for the Pinwheel Problem
par: Kleinberg, Robert, et autres
Publié: (2026)

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

Proofs of NP = coNP = PSPACE: Current upgrade
par: Gordeev, Lev, et autres
Publié: (2023)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
par: Gaspers, Serge, et autres
Publié: (2025)

Thin Tree Verification is coNP-Complete
par: Moayyedi, Alice
Publié: (2025)

On $NP \cap coNP$ proof complexity generators
par: Krajicek, Jan
Publié: (2025)

P vs. NP
par: Uribe, Daniel
Publié: (2016)

On P Versus NP
par: Gordeev, Lev
Publié: (2020)

A Critique of Lin's "On $\text{NP}$ versus $\text{coNP}$ and Frege Systems"
par: DeJesse, Nicholas, et autres
Publié: (2025)

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

BusOut is NP-complete
par: Ishibashi, Takehiro, et autres
Publié: (2025)

Communication Complexity is NP-hard
par: Hirahara, Shuichi, et autres
Publié: (2025)

On Kernelization with Access to NP-Oracles
par: Molter, Hendrik, et autres
Publié: (2025)

On the NP-Hardness Approximation Curve for Max-2Lin(2)
par: Martinsson, Björn
Publié: (2024)

No Complete Problem for Constant-Cost Randomized Communication
par: Fang, Yuting, et autres
Publié: (2024)

A Critique of Deng's "P=NP"
par: Humphreys, Isabel, et autres
Publié: (2025)

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

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
par: Guruswami, Venkatesan, et autres
Publié: (2023)

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

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
par: Abdullah, Duaa, et autres
Publié: (2025)

Determining unit distance graphs with coordinates in $\mathbb{Z}^2$ is NP-complete
par: Binnendyk, Eric
Publié: (2025)

Some conditions implying if P=NP then P=PSPACE
par: Rodriguez, Ismael
Publié: (2026)