A lower bound for monotone perceptrons (Q4841765): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01185398 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965730688 / rank | |||
Normal rank | |||
Latest revision as of 09:41, 30 July 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
29 April 1996
0 references
structural complexity theory
0 references
