Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464)

From MaRDI portal
scientific article; zbMATH DE number 7561743
Language Label Description Also known as
English
Algorithms and lower bounds for de morgan formulas of low-communication leaf gates
scientific article; zbMATH DE number 7561743

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    21 July 2022
    0 references
    De Morgan formulas
    0 references
    circuit lower bounds
    0 references
    satisfiability (SAT)
    0 references
    pseudorandom generators (PRGs)
    0 references
    learning
    0 references
    communication complexity
    0 references
    polynomial threshold functions (PTFs)
    0 references
    parities
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (English)
    0 references

    Identifiers