Cantitate/Preț
Produs
Total produse
Vezi coșul
Reversible Computation de Claudio Antares Mezzina

Reversible Computation: Lecture Notes in Computer Science, cartea 13354

Editat de Claudio Antares Mezzina, Krzysztof Podlaski
en Limba Engleză Paperback – 18 iun 2022
This book constitutes the refereed proceedings of the 14th International Conference on Reversible Computation, RC 2022, which was held in Urbino, Italy, during July 5-6, 2021.
The 10 full papers and 6 short papers included in this book were carefully reviewed and selected from 20 submissions.  They were organized in topical sections named: Reversible and Quantum Circuits;  Applications of quantum Computing; Foundations and Applications.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 40201 lei

Preț vechi: 50251 lei
-20%

Puncte Express: 603

Carte tipărită la comandă

Livrare economică 11-25 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783031090042
ISBN-10: 3031090047
Pagini: 252
Ilustrații: X, 239 p. 82 illus., 22 illus. in color.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:1st edition 2022
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Reversible and Quantum Circuits.- Reversible computation in integrated photonics.- Optimization of Quantum Boolean Circuits by Relative-Phase Toffoli Gates.- Constructing all qutrit controlled Clifford+T gates in Clifford+T.- Fast Control for Reversible Processors.- Designing a Reversible Stack Machine.- Applications of Quantum Computing.- Directed Graph Encoding in Quantum Computing supporting Edge-Failures.- Reordering Decision Diagrams for Quantum Computing Is Harder Than You Might Think.- Foundations and Applications.- Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean.- Algeo: An Algebraic Approach to Reversibility.- Concurrencies in Reversible Concurrent Calculi.- The @-Calculus.- Formal Translation from Reversing Petri Nets to Coloured Petri Nets.- Reversibility in Erlang: Imperative Constructs.- A Reversible Debugger for Imperative Parallel Programs with Contracts.- Towards Causal-consistent Reversibility of Imperative Concurrent Programs.