Inverting onto functions

Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
2003 Information and Computation  
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 polynomial-time 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
more » ... lynomial-time computable set of satisfiable formulae. • In polynomial time, one can convert the accepting computations of any nondeterministic Turing machine that accepts SAT to satisfying assignments. We compare these hypotheses with several other important complexity statements. We also examine the complexity of these statements where we only require a single bit instead of the entire inverse.
doi:10.1016/s0890-5401(03)00119-6 fatcat:vlvq2munznb3npgbtw2da5iivi