Pages that link to "Item:Q1582012"

The following pages link to Improved algorithms via approximations of probability distributions (Q1582012):

Displaying 22 items.

• Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
• Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
• Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals (Q1274894) (← links)
• Approximating probability distributions using small sample spaces (Q1288906) (← links)
• (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
• Improving and estimating the accuracy of Strassen's algorithm (Q1392412) (← links)
• Bounds and constructions for the star-discrepancy via \(\delta\)-covers (Q2576276) (← links)
• Algorithms for imprecise probabilities (Q2752130) (← links)
• Improved algorithms via approximations of probability distributions (extended abstract) (Q2817653) (← links)
• Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
• Optimization of algorithm estimation of certain probabilistic characteristics (Q3719780) (← links)
• (Q4218414) (← links)
• Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
• Efficient approximation of product distributions (Q4705321) (← links)
• MODp-tests, almost independence and small probability spaces (Q5047166) (← links)
• Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
• Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
• (Q5092453) (← links)
• More on bounded independence plus noise: pseudorandom generators for read-once polynomials (Q5140841) (← links)
• Entropy, Randomization, Derandomization, and Discrepancy (Q5326100) (← links)
• Sample spaces with small bias on neighborhoods and error-correcting communication protocols (Q5945921) (← links)
• Deterministic Massively Parallel Connectivity (Q6069413) (← links)