Inverting onto functions

  title={Inverting onto functions},
  author={Stephen A. Fenner and Lance Fortnow and Ashish V. Naik and John D. Rogers},
  journal={Inf. Comput.},
We look at the hypothesis that all honest onto polynomial-time computable functions have a polynomial-time computable inverse. We show this hypothesis equivalent to several other complexity conjectures including • In polynomial time, one can find accepting paths of nondeterministic polynomialtime Turing machines that accept Σ∗. • Every total multivalued nondeterministic function has a polynomial-time computable refinement. • In polynomial time, one can compute satisfying assignments for any… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 17 extracted citations


Publications referenced by this paper.

Similar Papers

Loading similar papers…