The conjunction complexity asymptotic of self-correcting circuits for monotone symmetric functions with threshold 2 (Q2018031): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q2968777 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4714495 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4301393 / rank | |||
Normal rank | |||
Latest revision as of 20:58, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The conjunction complexity asymptotic of self-correcting circuits for monotone symmetric functions with threshold 2 |
scientific article |
Statements
The conjunction complexity asymptotic of self-correcting circuits for monotone symmetric functions with threshold 2 (English)
0 references
24 March 2015
0 references
0 references
