Cantitate/Preț
Produs

Reversible Computation: Lecture Notes in Computer Science, cartea 12805

Editat de Shigeru Yamashita, Tetsuo Yokoyama
en Limba Engleză Paperback – 23 iun 2021
This book constitutes the refereed proceedings of the 13th International Conference on Reversible Computation, RC 2021, which was held online during July 7-8, 2021.
The 11 papers included in this book were carefully reviewed and selected from 21 submissions. The book also contains 2 invited talks in full-paper length, 3 work-in-progress papers and 1 tool paper. They were organized in topical sections named: programming and programming languages; reversible concurrent computation; theory and foundations; and circuit synthesis. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32156 lei

Preț vechi: 40194 lei
-20%

Puncte Express: 482

Carte tipărită la comandă

Livrare economică 08-22 iulie

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

Specificații

ISBN-13: 9783030798369
ISBN-10: 3030798364
Pagini: 288
Ilustrații: XII, 275 p. 137 illus., 57 illus. in color.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Invited Talks.- How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton.- Variational Quantum Eigensolver and Its Applications.- Programming and Programming Languages.- Reversible Functional Array Programming.- Compiling Janus to RSSA.- Causal-Consistent Debugging of Distributed Erlang Programs.- Towards a Unified Language Architecture for Reversible Object-Oriented Programming.- Reversible Concurrent Computation.- Towards a truly concurrent semantics for reversible CCS.- Forward-Reverse Observational Equivalences in CCSK.- Explicit Identifiers and Contexts in Reversible Concurrent Calculus.- Reversibility and predictions.- Theory and Foundations.- A Tangled Web of 12 Lens Laws.- Splitting recursion schemes into reversible and classical interacting threads.- Reversibility of Executable Interval Temporal Logic Specifications.- Circuit Synthesis.- Efficient Construction of Functional Representations for QuantumAlgorithms.- Finding Optimal Implementations of Non-native CNOT Gates using SAT.- Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network.- OR-Toffoli and OR-Peres Reversible Gates.