Q5009555 (Q5009555): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q239418 / rank
Normal rank
 
Property / author
 
Property / author: Rocco A. Servedio / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ACC / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for low degree polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Bits for Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On learning multivariate polynomials under the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Learning Algorithms for Decision Trees and Multivariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth Reduction for Composites / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient deterministic approximate counting for low-degree polynomial threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of a threshold gate at the top / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Correlation of Parity and Small-Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of small-depth threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agnostically Learning Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5748889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Number of Zeroes of a GF[2] Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Boolean functions by polynomials and threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators for Polynomial Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom bits for constant depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perceptrons of large weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning sparse multivariate polynomials over a field with queries and counterexamples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Small-Depth Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum of \(D\) small-bias generators fools polynomials of degree \(D\) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:48, 26 July 2024

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

    Statements

    0 references
    0 references
    4 August 2021
    0 references
    pseudorandom generators
    0 references
    correlation bounds
    0 references
    constant-depth circuits
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers