Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1903.11860

Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle

Titus Dose
View original source ↗Read source document ↗Export metadata ↓

Abstract

All versions of this paper contain errors. Therefore, the existence of an oracle relative to which (i) there exist complete disjoint coNP-pairs and (ii) there exist no complete total polynomial search problems must be considered as an open problem. In the following we refer to the version published in the proceedings of the 22nd International Symposium on Fundamentals of Computation Theory [Dos19] as this is the most recent version that has been published. The error is in the following sentence between the claims 4 and 5: Now let u' [symbol for strict extension] u be the minimal t'-valid oracle defined for all words of length q(n) (such an oracle exists according to Claim 4)." The problem is that here Claim 4 cannot be applied since for all \alpha, the function t' does not equal $t_\alpha$. References [Dos19] Titus Dose. Complete disjoint conp-pairs but no complete total polynomial search problems relative to an oracle. In Leszek Antoni Gasieniec, Jesper Jansson, and Christos Levcopoulos, editors, Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings, volume 11651 of Lecture Notes in Computer Science, pages 153{167}. Springer, 2019.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Titus Dose. 2019-03-28. Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle. https://arxiv.org/abs/1903.11860

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗