Pages that link to "Item:Q2848221"
From MaRDI portal
The following pages link to Pseudorandom Generators for Polynomial Threshold Functions (Q2848221):
Displaying 21 items.
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
- (Q2875170) (redirect page) (← links)
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
- Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs (Q3007622) (← links)
- Black-Box Reductions in Mechanism Design (Q3088099) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- (Q4612482) (← links)
- A Faster FPTAS for #Knapsack (Q5002742) (← links)
- (Q5009542) (← links)
- (Q5009555) (← links)
- Fooling Polytopes (Q5066946) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- Simple and efficient pseudorandom generators from gaussian processes (Q5091754) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- Concentration and Moment Inequalities for Polynomials of Independent Random Variables (Q5743410) (← links)
- A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 (Q5862347) (← links)
