Abstract:We study a class of functional problems reducible to computing $f^{(n)}(x)$
for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove,
the definition is robust against variations in the type of reduction used in
its definition, and in whether we require $f$ to have a polynomial-time inverse
or to be computible by a reversible logic circuit. These problems are
characterized by the complexity class $\mathsf{FP}^{\mathsf{PSPACE}}$, and
include natural $\mathsf{FP}^{\mathsf{PSPACE}}$-complete p… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.