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ț: 323.14 lei - 20%
Preț: 461.32 lei - 20%
Preț: 460.98 lei - 20%
Preț: 390.41 lei - 20%
Preț: 526.98 lei - 15%
Preț: 388.21 lei - 20%
Preț: 461.21 lei - 20%
Preț: 390.08 lei - 20%
Preț: 496.30 lei - 20%
Preț: 461.21 lei - 20%
Preț: 389.45 lei - 15%
Preț: 461.53 lei - 20%
Preț: 389.63 lei - 20%
Preț: 496.68 lei - 20%
Preț: 461.70 lei - 20%
Preț: 251.97 lei - 20%
Preț: 390.86 lei - 20%
Preț: 532.16 lei - 20%
Preț: 461.52 lei - 20%
Preț: 255.72 lei - 20%
Preț: 498.10 lei - 20%
Preț: 497.19 lei - 20%
Preț: 499.02 lei - 20%
Preț: 389.82 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.86 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.08 lei - 20%
Preț: 461.45 lei - 20%
Preț: 392.36 lei - 20%
Preț: 460.75 lei - 20%
Preț: 461.32 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.26 lei - 20%
Preț: 390.66 lei - 20%
Preț: 391.57 lei - 20%
Preț: 389.57 lei - 20%
Preț: 497.97 lei - 20%
Preț: 462.36 lei - 20%
Preț: 460.67 lei - 20%
Preț: 423.95 lei - 5%
Preț: 515.91 lei - 15%
Preț: 535.55 lei - 20%
Preț: 531.90 lei - 20%
Preț: 403.00 lei - 20%
Preț: 535.41 lei - 20%
Preț: 461.25 lei - 20%
Preț: 498.17 lei - 20%
Preț: 461.52 lei - 20%
Preț: 249.77 lei
Preț: 322.61 lei
Preț vechi: 403.26 lei
-20%
Puncte Express: 484
Preț estimativ în valută:
57.10€ • 66.72$ • 49.56£
57.10€ • 66.72$ • 49.56£
Carte tipărită la comandă
Livrare economică 25 februarie-11 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