19 research outputs found
Inverting Onto Functions and Polynomial Hierarchy
In this paper we construct an oracle under which
the polynomial hierarchy is infinite but
there are non-invertible polynomial time computable multivalued onto functions
Nondeterministic functions and the existence of optimal proof systems
We provide new characterizations of two previously studied questions on nondeterministic function classes: Q1: Do nondeterministic functions admit efficient deterministic refinements? Q2: Do nondeterministic function classes contain complete functions? We show that Q1 for the class is equivalent to the question whether the standard proof system for SAT is p-optimal, and to the assumption that every optimal proof system is p-optimal. Assuming only the existence of a p-optimal proof system for SAT, we show that every set with an optimal proof system has a p-optimal proof system. Under the latter assumption, we also obtain a positive answer to Q2 for the class . An alternative view on nondeterministic functions is provided by disjoint sets and tuples. We pursue this approach for disjoint -pairs and its generalizations to tuples of sets from and with disjointness conditions of varying strength. In this way, we obtain new characterizations of Q2 for the class . Question Q1 for is equivalent to the question of whether every disjoint -pair is easy to separate. In addition, we characterize this problem by the question of whether every propositional proof system has the effective interpolation property. Again, these interpolation properties are intimately connected to disjoint -pairs, and we show how different interpolation properties can be modeled by -pairs associated with the underlying proof system
A note on the size of Craig Interpolants
Mundici considered the question of whether the interpolant of two
propositional formulas of the form can always have
a short circuit description, and showed that if this is the case then
every problem in NP co-NP would have polynomial size circuits.
In this note we observe further consequences of the interpolant having
short circuit descriptions, namely that
UP Ppoly, and that every single valued NP function has a
total extension in FPpoly. We also relate
this question with other
Complexity Theory assumptions
Reducing the Number of Solutions of NP Functions
AbstractWe study whether one can prune solutions from NP functions. Though it is known that, unless surprising complexity class collapses occur, one cannot reduce the number of accepting paths of NP machines, we nonetheless show that it often is possible to reduce the number of solutions of NP functions. For finite cardinality types, we give a sufficient condition for such solution reduction. We also give absolute and conditional necessary conditions for solution reduction, and in particular we show that in many cases solution reduction is impossible unless the polynomial hierarchy collapses