On asymptotic gate complexity and depth of reversible circuits without additional memory (Q340566)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6652744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On asymptotic gate complexity and depth of reversible circuits without additional memory |
scientific article; zbMATH DE number 6652744 |
Statements
On asymptotic gate complexity and depth of reversible circuits without additional memory (English)
0 references
14 November 2016
0 references
reversible logic
0 references
gate complexity
0 references
circuit depth
0 references
asymptotic bounds
0 references
0.9047442
0 references
0.8943261
0 references
0.8898717
0 references
0.8854609
0 references
0.8776477
0 references
0.8654571
0 references
0.8589856
0 references
0.85675263
0 references
