104 research outputs found
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction
We show that the counting class LWPP [FFK94] remains unchanged even if one
allows a polynomial number of gap values rather than one. On the other hand, we
show that it is impossible to improve this from polynomially many gap values to
a superpolynomial number of gap values by relativizable proof techniques.
The first of these results implies that the Legitimate Deck Problem (from the
study of graph reconstruction) is in LWPP (and thus low for PP, i.e., \rm
PP^{\mbox{Legitimate Deck}} = PP) if the weakened version of the
Reconstruction Conjecture holds in which the number of nonisomorphic preimages
is assumed merely to be polynomially bounded. This strengthens the 1992 result
of K\"{o}bler, Sch\"{o}ning, and Tor\'{a}n [KST92] that the Legitimate Deck
Problem is in LWPP if the Reconstruction Conjecture holds, and provides
strengthened evidence that the Legitimate Deck Problem is not NP-hard.
We additionally show on the one hand that our main LWPP robustness result
also holds for WPP, and also holds even when one allows both the rejection- and
acceptance- gap-value targets to simultaneously be polynomial-sized lists; yet
on the other hand, we show that for the #P-based analog of LWPP the behavior
much differs in that, in some relativized worlds, even two target values
already yield a richer class than one value does. Despite that nonrobustness
result for a #P-based class, we show that the #P-based "exact counting" class
remains unchanged even if one allows a polynomial number of target
values for the number of accepting paths of the machine
A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem
Rice's Theorem states that every nontrivial language property of the
recursively enumerable sets is undecidable. Borchert and Stephan initiated the
search for complexity-theoretic analogs of Rice's Theorem. In particular, they
proved that every nontrivial counting property of circuits is UP-hard, and that
a number of closely related problems are SPP-hard.
The present paper studies whether their UP-hardness result itself can be
improved to SPP-hardness. We show that their UP-hardness result cannot be
strengthened to SPP-hardness unless unlikely complexity class containments
hold. Nonetheless, we prove that every P-constructibly bi-infinite counting
property of circuits is SPP-hard. We also raise their general lower bound from
unambiguous nondeterminism to constant-ambiguity nondeterminism.Comment: 14 pages. To appear in Theoretical Computer Scienc
A Galois connection between Turing jumps and limits
Limit computable functions can be characterized by Turing jumps on the input
side or limits on the output side. As a monad of this pair of adjoint
operations we obtain a problem that characterizes the low functions and dually
to this another problem that characterizes the functions that are computable
relative to the halting problem. Correspondingly, these two classes are the
largest classes of functions that can be pre or post composed to limit
computable functions without leaving the class of limit computable functions.
We transfer these observations to the lattice of represented spaces where it
leads to a formal Galois connection. We also formulate a version of this result
for computable metric spaces. Limit computability and computability relative to
the halting problem are notions that coincide for points and sequences, but
even restricted to continuous functions the former class is strictly larger
than the latter. On computable metric spaces we can characterize the functions
that are computable relative to the halting problem as those functions that are
limit computable with a modulus of continuity that is computable relative to
the halting problem. As a consequence of this result we obtain, for instance,
that Lipschitz continuous functions that are limit computable are automatically
computable relative to the halting problem. We also discuss 1-generic points as
the canonical points of continuity of limit computable functions, and we prove
that restricted to these points limit computable functions are computable
relative to the halting problem. Finally, we demonstrate how these results can
be applied in computable analysis
An Atypical Survey of Typical-Case Heuristic Algorithms
Heuristic approaches often do so well that they seem to pretty much always
give the right answer. How close can heuristic algorithms get to always giving
the right answer, without inducing seismic complexity-theoretic consequences?
This article first discusses how a series of results by Berman, Buhrman,
Hartmanis, Homer, Longpr\'{e}, Ogiwara, Sch\"{o}ening, and Watanabe, from the
early 1970s through the early 1990s, explicitly or implicitly limited how well
heuristic algorithms can do on NP-hard problems. In particular, many desirable
levels of heuristic success cannot be obtained unless severe, highly unlikely
complexity class collapses occur. Second, we survey work initiated by Goldreich
and Wigderson, who showed how under plausible assumptions deterministic
heuristics for randomized computation can achieve a very high frequency of
correctness. Finally, we consider formal ways in which theory can help explain
the effectiveness of heuristics that solve NP-hard problems in practice.Comment: This article is currently scheduled to appear in the December 2012
issue of SIGACT New
Sparse Selfreducible Sets and Nonuniform Lower Bounds
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in (Formula presented.), or even in (Formula presented.) that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are selfreducible? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that (Formula presented.) does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that (Formula presented.) does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of (Formula presented.) is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for (Formula presented.)
Separating the low and high hierachies by oracles
AbstractThe relativized low and high hierarchies within NP are considered. An oracle A is constructed such that the low and high hierarchies relative to A are infinite, and for each k an oracle Ak is constructed such that the low and high hierarchies relative to Ak have exactly k levels
- …