Complexity of Boolean functions' representations in classes of extended pair-generated operator forms (Q2633615): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computational bound on complexity of polynomial representations of Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of Boolean functions in the class of polarized polynomial forms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2748260 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of the representation of multiple-output Boolean functions / rank | |||
Normal rank | |||
Latest revision as of 04:50, 19 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Boolean functions' representations in classes of extended pair-generated operator forms |
scientific article |
Statements
Complexity of Boolean functions' representations in classes of extended pair-generated operator forms (English)
0 references
9 May 2019
0 references
Boolean functions
0 references
polynomial normal forms
0 references
exclusive-or sum-of-products expressions
0 references
extended pair-generated operator forms
0 references
