Exact value of the nonmonotone complexity of Boolean functions (Q2313604): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Vadim V. Kochergin / rank | |||
Property / author | |||
Property / author: Q2313603 / rank | |||
Property / author | |||
Property / author: Vadim V. Kochergin / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Anna Vital'evna Mikhailovich / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3244105 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4172915 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5557960 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5600476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4092993 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Boolean function complexity. Advances and frontiers. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Learning circuits with few negations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Power of Negations in Cryptography / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The minimum number of negations in circuits for systems of multi-valued functions / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1134/s0001434619010048 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2937666310 / rank | |||
Normal rank |
Latest revision as of 09:36, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Exact value of the nonmonotone complexity of Boolean functions |
scientific article |
Statements
Exact value of the nonmonotone complexity of Boolean functions (English)
0 references
19 July 2019
0 references
Boolean (logical) circuits
0 references
circuits of functional elements
0 references
circuit complexity
0 references
inversion complexity
0 references
nonmonotone complexity
0 references