Q4568115 (Q4568115): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algebrization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of voting polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining circuit lower bound proofs for meta-algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case lower bounds and satisfiability algorithms for small threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration Inequalities and Martingale Inequalities: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Independence Fools Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of Measure for the Analysis of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tail bound for read-<i>k</i>families of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning and Lower Bounds for AC 0 with Threshold Gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral properties of threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size--Depth Tradeoffs for Threshold Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large deviations for sums of partly dependent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning intersections and thresholds of halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case lower bounds for formula size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant depth circuits, Fourier transform, and learnability / 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: 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: Hardness amplification within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Chow Parameters Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating threshold circuits by rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bound for bounded depth circuits with few threshold gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural proofs / 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: Q4839051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every linear threshold function has a low-weight approximator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for sign-representing the intersection of two halfspaces by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational approximation techniques for analysis of neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform ACC Circuit Lower Bounds / rank
 
Normal rank

Revision as of 22:11, 15 July 2024

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

    Statements

    0 references
    0 references
    0 references
    15 June 2018
    0 references
    complexity theory
    0 references
    circuit complexity
    0 references
    correlation bounds
    0 references
    threshold functions
    0 references
    random restrictions
    0 references
    learning
    0 references
    SAT
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references