Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC (Q4302863)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 622343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC |
scientific article; zbMATH DE number 622343 |
Statements
Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC (English)
0 references
21 August 1994
0 references
parallelism
0 references
probabilistic computation
0 references
computations on discrete structures
0 references
combinatorial algorithms
0 references
graph algorithms
0 references
removing randomness
0 references
randomized NC algorithms
0 references
polylogarithmic independence
0 references
set discrepancy problem
0 references
edge coloring
0 references
hypergraph coloring
0 references
0.82604355
0 references
0.8218494
0 references
0.81739193
0 references
0.8111523
0 references
0.8090159
0 references
0.80715865
0 references
0 references
0.8067418
0 references
0 references
