
Analyzing Tradeoffs in Reversible Linear and Binary Search Algorithms
Reversible algorithms are algorithms in which each step represents a par...
read it

FPTAlgorithms for the lMatchoid Problem with Linear and Submodular Objectives
We design a fixedparameter deterministic algorithm for computing a maxi...
read it

Optimalsize problem kernels for dHitting Set in linear time and space
We improve two lineartime data reduction algorithms for the dHitting S...
read it

Differentiate Everything with a Reversible DomainSpecific Language
Traditional machine instruction level reverse mode automatic differentia...
read it

A complete axiomatisation of reversible Kleene lattices
We consider algebras of languages over the signature of reversible Kleen...
read it

Fractional Types: Expressive and Safe Space Management for Ancilla Bits
In reversible computing, the management of space is subject to two broad...
read it

Counting Triangles under Updates in WorstCase Optimal Time
We consider the problem of incrementally maintaining the triangle count ...
read it
Relativized Separation of Reversible and Irreversible SpaceTime Complexity Classes
Reversible computing can reduce the energy dissipation of computation, which can improve costefficiency in some contexts. But the practical applicability of this method depends sensitively on the space and time overhead required by reversible algorithms. Time and space complexity classes for reversible machines match conventional ones, but we conjecture that the joint spacetime complexity classes are different, and that a particular reduction by Bennett minimizes the spacetime product complexity of general reversible computations. We provide an oraclerelativized proof of the separation, and of a lower bound on space for lineartime reversible simulations. A nonoracle proof applies when a readonly input is omitted from the space accounting. Both constructions model oneway function iteration, conjectured to be a problem for which Bennett's algorithm is optimal.
READ FULL TEXT
Comments
There are no comments yet.