The Complexity of Iterated Reversible Computation

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

Full description

Bibliographic Details

Published in:	TheoretiCS Vol. 2
Main Author:	Eppstein, David
Format:	Journal Article
Language:	English
Published:	TheoretiCS Foundation e.V 26.12.2023
Subjects:	68q10, 68q15, 68q80 computer science - computational complexity f.1.1 nonlinear sciences - cellular automata and lattice gases
ISSN:	2751-4838, 2751-4838
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!