The complexity of the descriptiveness of Boolean circuits over different sets of gates (Q2464338): 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.1007/s00224-006-1301-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2055594799 / rank | |||
Normal rank |
Latest revision as of 19:29, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of the descriptiveness of Boolean circuits over different sets of gates |
scientific article |
Statements
The complexity of the descriptiveness of Boolean circuits over different sets of gates (English)
0 references
19 December 2007
0 references
Boolean function
0 references