ForNo, a reversible stack language, is claimed to characterize exactly the polynomial-time two-way bijections with zero garbage.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Towards a Characterization of Two-way Bijections in a Reversible Computational Model
ForNo, a reversible stack language, is claimed to characterize exactly the polynomial-time two-way bijections with zero garbage.