On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (Q2332856): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1515/dma-2019-0022 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2968036895 / rank | |||
Normal rank |
Revision as of 19:43, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates |
scientific article |
Statements
On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (English)
0 references
5 November 2019
0 references
bounded-depth circuits
0 references
complexity
0 references
Boolean cube partitions
0 references