Pages that link to "Item:Q4705321"
From MaRDI portal
The following pages link to Efficient approximation of product distributions (Q4705321):
Displaying 18 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Randomness buys depth for approximate counting (Q483707) (← links)
- Deterministic constructions of high-dimensional sets with small dispersion (Q2149098) (← links)
- Adding cardinality constraints to integer programs with applications to maximum satisfiability (Q2380072) (← links)
- On the derandomization of the graph test for homomorphism over groups (Q2430014) (← links)
- Cost-sharing mechanisms for network design (Q2471805) (← links)
- Envy-free pricing with general supply constraints for unit demand consumers (Q2637287) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Robust characterizations of <i>k</i> -wise independence over product spaces and related testing results (Q2856576) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
- Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
- (Q5140841) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- Entropy, Randomization, Derandomization, and Discrepancy (Q5326100) (← links)
- (Q5857609) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
