Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits (Q785027)
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 7228747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits |
scientific article; zbMATH DE number 7228747 |
Statements
Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits (English)
0 references
5 August 2020
0 references
somewhat homomorphic encryption
0 references
multiplicative depth
0 references
Boolean functions
0 references
heuristic
0 references
0.9106837511062622
0 references
0.7826946377754211
0 references
0.758875846862793
0 references
0.757787823677063
0 references
0.756727397441864
0 references
