Circuit complexity of symmetric Boolean functions in antichain basis (Q314174): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2340850974 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1410.2456 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of schemes in an infinite basis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4866344 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Circuit complexity of symmetric Boolean functions in antichain basis / rank | |||
Normal rank | |||
Latest revision as of 13:28, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circuit complexity of symmetric Boolean functions in antichain basis |
scientific article |
Statements
Circuit complexity of symmetric Boolean functions in antichain basis (English)
0 references
13 September 2016
0 references
Boolean circuit complexity
0 references
antichain functions
0 references
Boolean circuits
0 references
symmetric Boolean functions
0 references
Shannon function
0 references
