On the sensitivity complexity of \(k\)-uniform hypergraph properties (Q5065634)
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 7495902
| 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 7495902 |
Statements
On the Sensitivity Complexity of <i>k</i> -Uniform Hypergraph Properties (English)
0 references
22 March 2022
0 references
\(k\)-uniform hypergraph properties
0 references
Boolean function
0 references
sensitivity complexity
0 references
Turán's question
0 references
0.9735516905784608
0 references
0.806934654712677
0 references
0.7937018871307373
0 references
0.7870056629180908
0 references
0.7812299728393555
0 references
