On the sensitivity complexity of \(k\)-uniform hypergraph properties (Q4636652)
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: On the sensitivity complexity of k-uniform hypergraph properties |
scientific article; zbMATH DE number 6862143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sensitivity complexity of \(k\)-uniform hypergraph properties |
scientific article; zbMATH DE number 6862143 |
Statements
19 April 2018
0 references
sensitivity complexity
0 references
\(k\)-uniform hypergraph properties
0 references
Boolean function
0 references
Turán's question
0 references
On the Sensitivity Complexity of k-Uniform Hypergraph Properties (English)
0 references
0.9735516905784608
0 references
0.8272010684013367
0 references
0.8151806592941284
0 references
0.7985134124755859
0 references
0.794221043586731
0 references
