Pages that link to "Item:Q1120201"

The following pages link to On the power of two-point based sampling (Q1120201):

Displaying 39 items.

• The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
• A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
• Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
• Local randomness in pseudorandom sequences (Q1180515) (← links)
• \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\) (Q1288206) (← links)
• Extracting randomness: A survey and new constructions (Q1305929) (← links)
• Randomness in interactive proofs (Q1321030) (← links)
• Provably good pattern generators for a random pattern test (Q1322559) (← links)
• A simple analysis of the error probability of two-point based sampling (Q1350935) (← links)
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
• Improved algorithms via approximations of probability distributions (Q1582012) (← links)
• Randomized OBDD-based graph algorithms (Q1625606) (← links)
• A combinatorial error bound for \(t\)-point-based sampling (Q1884988) (← links)
• A connection between random variables and latin \(k\)-cubes (Q1903745) (← links)
• On the oracle complexity of factoring integers (Q1918949) (← links)
• Simulating BPP using a general weak random source (Q1923854) (← links)
• Quasi-random rumor spreading: reducing randomness can be costly (Q1944078) (← links)
• A PCP of proximity for real algebraic polynomials (Q2117096) (← links)
• Realistic analysis of some randomized algorithms (Q2277019) (← links)
• On the complexity of constructing pseudorandom functions (especially when they don't exist) (Q2516523) (← links)
• A time-randomness tradeoff for quasi-random rumour spreading (Q2851485) (← links)
• Robust characterizations of \(k\)-wise independence over product spaces and related testing results (Q2856576) (← links)
• The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (Q2946032) (← links)
• In a World of P=BPP (Q3088186) (← links)
• A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
• Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
• (Q3498002) (← links)
• (Q3542184) (← links)
• Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 (Q4562282) (← links)
• Simple fast parallel hashing (Q4632430) (← links)
• Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
• Efficient constructions of Hitting Sets for systems of linear functions (Q5048940) (← links)
• Polynomial hash functions are reliable (Q5204320) (← links)
• (Q5875519) (← links)
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
• Pseudorandom generators without the XOR lemma (Q5943089) (← links)
• Deterministic Massively Parallel Connectivity (Q6069413) (← links)
• Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629) (← links)