Inverting onto functions

  • Authors:

  • Stephen A. Fenner;Lance Fortnow;Ashish V. Naik;John D. Rogers

  • Affiliations:

  • University of Southern Maine, Portland, ME;University of Chicago, Chicago, IL;University of Chicago, Chicago, IL;School of Computer Science, Telecommunications, and Information Systems, CS&T Center, DePaul University, Suite 747, 243 South Wabash Avenue, Chicago, IL

  • Venue:
  • Information and Computation
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 polynomial-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.