Level-p-complexity of Boolean functions using thinning, memoization, and polynomials (Q6131903)
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: Level-p-complexity of Boolean functions using thinning, memoization, and polynomials |
scientific article; zbMATH DE number 7834327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Level-p-complexity of Boolean functions using thinning, memoization, and polynomials |
scientific article; zbMATH DE number 7834327 |
Statements
Level-p-complexity of Boolean functions using thinning, memoization, and polynomials (English)
0 references
18 April 2024
0 references
