A lower bound for monotone perceptrons (Q4841765): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The expressive power of voting polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An oracle separating \(\oplus P\) from \(PP^{PH}\) / 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: Q4035673 / rank
 
Normal rank

Latest revision as of 15:53, 23 May 2024

scientific article; zbMATH DE number 778428
Language Label Description Also known as
English
A lower bound for monotone perceptrons
scientific article; zbMATH DE number 778428

    Statements

    A lower bound for monotone perceptrons (English)
    0 references
    0 references
    29 April 1996
    0 references
    0 references
    structural complexity theory
    0 references