An extension of Khrapchenko's theorem (Q753798)
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: Publication:753798 |
scientific article; zbMATH DE number 4181291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extension of Khrapchenko's theorem |
scientific article; zbMATH DE number 4181291 |
Statements
An extension of Khrapchenko's theorem (English)
0 references
1991
0 references
computational complexity
0 references
lower bounds on the formula complexity of Boolean functions
0 references
formula complexity of the parity function
0 references
Huffman coding
0 references
0.841512143611908
0 references
0.8177146315574646
0 references
0.7931327819824219
0 references
0.785879373550415
0 references
0.7814878821372986
0 references
