No label defined (Q5009555)

From MaRDI portal

Revision as of 08:48, 26 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7378668

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7378668

Statements

scholarly article

0 references

10.4230/LIPIcs.APPROX-RANDOM.2018.56

0 references

0 references

Rocco A. Servedio

0 references

publication date

4 August 2021

0 references

full work available at URL

https://arxiv.org/abs/1803.04553

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

pseudorandom generators

0 references

correlation bounds

0 references

constant-depth circuits

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

0 references

Pseudorandom generators for low degree polynomials

0 references

Pseudorandom Bits for Polynomials

0 references

On learning multivariate polynomials under the uniform distribution

0 references

Simple Learning Algorithms for Decision Trees and Multivariate Polynomials

0 references

Depth Reduction for Composites

0 references

Efficient deterministic approximate counting for low-degree polynomial threshold functions

0 references

0 references

On the power of a threshold gate at the top

0 references

Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields

0 references

Mathematical Foundations of Computer Science 2004

0 references

On the Correlation of Parity and Small-Depth Circuits

0 references

On the power of small-depth threshold circuits

0 references

0 references

Agnostically Learning Halfspaces

0 references

0 references

Approximating the Number of Zeroes of a GF[2] Polynomial

0 references

Computing Boolean functions by polynomials and threshold circuits

0 references

0 references

Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates

0 references

Pseudorandom Generators for Polynomial Threshold Functions

0 references

0 references

Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP

0 references

Pseudorandom bits for constant depth circuits

0 references

0 references

Hardness vs randomness

0 references

Perceptrons of large weight

0 references

\(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom

0 references

Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$

0 references

Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression

0 references

Learning sparse multivariate polynomials over a field with queries and counterexamples.

0 references

0 references

Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates

0 references

On the Power of Small-Depth Computation

0 references

The sum of \(D\) small-bias generators fools polynomials of degree \(D\)

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5009555

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5009555&oldid=36704113"