The following pages link to (Q3975935):
Displaying 8 items.
- The fourth moment in Luby's distribution (Q672385) (← links)
- Parallel PROFIT/COST algorithms through fast derandomization (Q1306566) (← links)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- Derandomized graph products (Q1842777) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Derandomization through approximation, an NC algorithm for minimum cuts (Q2817641) (← links)
- The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)
- Massively Parallel Algorithms for Minimum Cut (Q5855214) (← links)