Fast computing the algebraic degree of Boolean functions (Q2175408)
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: Fast computing the algebraic degree of Boolean functions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast computing the algebraic degree of Boolean functions |
scientific article |
Statements
Fast computing the algebraic degree of Boolean functions (English)
0 references
29 April 2020
0 references
Boolean function
0 references
algebraic normal form
0 references
algebraic degree
0 references
weight-lexicographic order
0 references
WLO sequence generating
0 references
byte-wise algorithm
0 references
WLO masks generating
0 references
bitwise algorithm
0 references
0.8535683155059814
0 references
0.8149080276489258
0 references
0.805607795715332
0 references
0.7988250255584717
0 references
