Pages that link to "Item:Q2848221"

The following pages link to Pseudorandom generators for polynomial threshold functions (Q2848221):

Displaying 32 items.

• A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← links)
• Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (Q395606) (← links)
• Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
• On pseudorandom numbers from multivariate polynomial systems (Q708433) (← 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)
• Pseudorandom generators for polynomial threshold functions (Q2848221) (← links)
• (Q2875170) (redirect page) (← links)
• A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
• Unconditional pseudorandom generators for low degree polynomials (Q3002801) (← 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)
• A polylogarithmic PRG for degree 2 threshold functions in the Gaussian setting (Q4601847) (← links)
• (Q4612482) (← links)
• Pseudorandom generators for low sensitivity functions (Q4993293) (← 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)
• (Q5121889) (← links)
• Amplification and Derandomization without Slowdown (Q5129234) (← links)
• More on bounded independence plus noise: pseudorandom generators for read-once polynomials (Q5140841) (← links)
• Pseudorandom generators from polarizing random walks (Q5204828) (← links)
• Pseudorandomness from Shrinkage (Q5244384) (← links)
• A PRG for lipschitz functions of polynomials with applications to sparsest cut (Q5495770) (← 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)