scientific article; zbMATH DE number 7378668
From MaRDI portal
Publication:5009555
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.56MaRDI QIDQ5009555
Li-Yang Tan, Rocco A. Servedio
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1803.04553
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Quantified Derandomization: How to Find Water in the Ocean ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On hitting-set generators for polynomials that vanish rarely
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the power of a threshold gate at the top
- On learning multivariate polynomials under the uniform distribution
- The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
- On the power of small-depth threshold circuits
- Perceptrons of large weight
- Pseudorandom bits for constant depth circuits
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
- Computing Boolean functions by polynomials and threshold circuits
- Hardness vs randomness
- On ACC
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
- Pseudorandom Generators for Polynomial Threshold Functions
- Pseudorandom Bits for Polynomials
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
- On the Power of Small-Depth Computation
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Agnostically Learning Halfspaces
- Pseudorandom generators for low degree polynomials
- Approximating the Number of Zeroes of a GF[2 Polynomial]
- Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression
- Depth Reduction for Composites
- Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
- On the Correlation of Parity and Small-Depth Circuits
- Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP
- Efficient deterministic approximate counting for low-degree polynomial threshold functions
- Mathematical Foundations of Computer Science 2004
- Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates
This page was built for publication:
