Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (Q895458): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3249579 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3340780 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5445419 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast algorithm for the construction of polynomials modulo k for k-valued functions for composite k / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A class of Boolean functions with linear combinational complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3758729 / rank | |||
Normal rank |
Latest revision as of 03:18, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables |
scientific article |
Statements
Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (English)
0 references
3 December 2015
0 references
Boolean function
0 references
polynomial
0 references
circuit
0 references
circuit complexity
0 references
lower bound
0 references
0 references