Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs (Q4870538)
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: Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs |
scientific article; zbMATH DE number 858005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
