CINECA IRIS Institutional Research Information System

We introduce an imperative, stack-based, and reversible computational model that characterizes Two-way bijections both implicitly, concerning their computational complexity, and with zero-garbage.

Towards a Characterization of Two-Way Bijections in a Reversible Computational Model

Palazzo, Matteo
Co-first
Membro del Collaboration Group
;Roversi, Luca
Co-first
Membro del Collaboration Group
2025-01-01

Abstract

We introduce an imperative, stack-based, and reversible computational model that characterizes Two-way bijections both implicitly, concerning their computational complexity, and with zero-garbage.
2025
17th International Conference on Reversible Computation, RC 2025
Odense, Danimarca
2025
Lecture Notes in Computer Science
Springer Science and Business Media Deutschland GmbH
15716
128
136
9783031970627
9783031970634
https://link.springer.com/chapter/10.1007/978-3-031-97063-4_10
https://arxiv.org/abs/2506.03382
Imperative Computational Models; Implicit Computational Complexity; Reversible Computing; Two-way bijections
Palazzo, Matteo; Roversi, Luca
04A-Conference paper in volume
File in questo prodotto:
File Dimensione Formato  
2506.03382v1.pdf

Accesso aperto

Descrizione: Palazz-Roversi-RC2025
Tipo di file: POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione 591.42 kB
Formato Adobe PDF
Visualizza/Apri
591.42 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/2118470
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact