Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs (Q4870538): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199603)8:2<131::aid-rsa4>3.0.co;2-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974136796 / rank | |||
Normal rank | |||
| Property / title | |||
Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs (English) | |||
| Property / title: Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs (English) / rank | |||
Normal rank | |||
Latest revision as of 09:14, 30 July 2024
scientific article; zbMATH DE number 858005
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs |
scientific article; zbMATH DE number 858005 |
Statements
20 March 1996
0 references
Chebyshev's inequality
0 references
polynomial time algorithm
0 references
independent set
0 references
regular hypergraph
0 references
Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs (English)
0 references
