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ț: 426.75 lei - 20%
Preț: 315.62 lei - 20%
Preț: 320.92 lei - 15%
Preț: 426.53 lei - 20%
Preț: 313.87 lei - 20%
Preț: 355.79 lei - 20%
Preț: 355.54 lei - 20%
Preț: 355.18 lei - 20%
Preț: 390.68 lei - 20%
Preț: 392.03 lei - 20%
Preț: 498.95 lei - 20%
Preț: 390.79 lei - 20%
Preț: 495.44 lei - 20%
Preț: 498.80 lei - 20%
Preț: 498.50 lei - 20%
Preț: 355.93 lei - 20%
Preț: 639.52 lei - 20%
Preț: 499.90 lei - 20%
Preț: 498.95 lei - 20%
Preț: 270.68 lei - 20%
Preț: 321.68 lei - 20%
Preț: 391.36 lei - 20%
Preț: 322.09 lei - 20%
Preț: 498.90 lei - 20%
Preț: 312.82 lei - 20%
Preț: 496.73 lei - 20%
Preț: 463.03 lei - 20%
Preț: 531.75 lei - 15%
Preț: 496.40 lei - 20%
Preț: 497.25 lei - 20%
Preț: 498.80 lei - 20%
Preț: 461.86 lei - 20%
Preț: 355.59 lei - 20%
Preț: 324.19 lei -
Preț: 418.19 lei - 20%
Preț: 498.59 lei - 20%
Preț: 391.28 lei - 20%
Preț: 355.69 lei - 15%
Preț: 499.72 lei - 20%
Preț: 499.40 lei - 20%
Preț: 390.42 lei - 20%
Preț: 497.75 lei - 20%
Preț: 326.81 lei - 20%
Preț: 322.32 lei - 20%
Preț: 390.42 lei - 20%
Preț: 458.84 lei - 20%
Preț: 427.09 lei - 20%
Preț: 499.90 lei - 20%
Preț: 320.72 lei
Preț: 322.61 lei
Preț vechi: 403.26 lei
-20% Nou
Puncte Express: 484
Preț estimativ în valută:
57.09€ • 66.57$ • 50.12£
57.09€ • 66.57$ • 50.12£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
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