Pages that link to "Item:Q4302863"
From MaRDI portal
The following pages link to Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC (Q4302863):
Displayed 19 items.
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Removing randomness in parallel computation without a processor penalty (Q1309384) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Derandomized Construction of Combinatorial Batch Codes (Q2947886) (← links)
- Rosenthal type inequalities for random variables (Q3304667) (← links)
- MODp-tests, almost independence and small probability spaces (Q5047166) (← links)
- (Q5212563) (← links)
- Very fast parallel algorithms for approximate edge coloring (Q5929308) (← links)
- Near-optimal distributed edge coloring (Q6102321) (← links)