Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash (Q5738783)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash |
scientific article; zbMATH DE number 6729583
Language | Label | Description | Also known as |
---|---|---|---|
English | Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash |
scientific article; zbMATH DE number 6729583 |
Statements
Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash (English)
0 references
13 June 2017
0 references