Reversible Computation: 8th International Conference, RC 2016, Bologna, Italy, July 7-8, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9720
Editat de Simon Devitt, Ivan Laneseen Limba Engleză Paperback – 30 iun 2016
The 18 full and 5 short papers included in this volume were carefully reviewed and selected from 38 submissions. The papers are organized in topical sections named: process calculi; reversible models; programming languages; quantum computing; quantum programming; circuit theory; and syntheses.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 335.36 lei
Preț vechi: 419.20 lei
-20% Nou
Puncte Express: 503
Preț estimativ în valută:
64.20€ • 66.99$ • 53.82£
64.20€ • 66.99$ • 53.82£
Carte tipărită la comandă
Livrare economică 13-27 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319405773
ISBN-10: 3319405772
Pagini: 322
Ilustrații: XIII, 339 p. 109 illus.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.5 kg
Ediția:1st ed. 2016
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Cham, Switzerland
ISBN-10: 3319405772
Pagini: 322
Ilustrații: XIII, 339 p. 109 illus.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.5 kg
Ediția:1st ed. 2016
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Cham, Switzerland
Cuprins
Process Calculi.- Rigid Families for the Reversible pi-calculus.- A calculus for local reversibility.- Static VS Dynamic Reversibility in CCS.- Reversing Single Sessions.- Reversible Models.- Reversible causal graph dynamics.- Boosting Reversible Pushdown Machines By Preprocessing.- Reversible Computation vs. Reversibility in Petri Nets.- Programming Languages.- Energy Efficient Language and Compiler for (Partially) Reversible Algorithms.- Mixing Hardware and Software Reversibility for Speculative Parallel Discrete Event Simulation.- Quaglia.- Elements of a Reversible Object-Oriented Language.- Initial Ideas for Automatic Design and Verification of Control Logic in Reversible HDLs.- Quantum Computing.- Design and Fabrication of CSWAP Gate Based on Nanoelectromechanical Systems.- Design of p-valued Deutsch quantum gates with multiple control signals and mixed polarity.- Using pi-DDsforNearestNeighborOptimizationofQuantumCircuits.- Quantum Programming.- Circular CNOT Circuits: Definition, Analysis and Application to Fault-Tolerant Quantum Circuits.- Towards Quantum Programs Verification: From Quipper Circuits to QPMC.- Circuit Theory.-Application of Permutation Group Theory in Reversible Logic Synthesis.- Strongly Universal Reversible Gate Sets.- Enumeration of reversible functions and its application to circuit complexity.- A finite alternation result for reversible Boolean circuits.- Syntheses.- Generating reversible circuits from higher-order functional programs.- A fast symbolic transformation based algorithm for reversible logic synthesis.-Checking Reversibility of Boolean Functions.
Caracteristici
Includes supplementary material: sn.pub/extras