Formula complexity of a linear function in a \(k\)-ary basis (Q2037681): Difference between revisions
From MaRDI portal
Latest revision as of 09:45, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Formula complexity of a linear function in a \(k\)-ary basis |
scientific article |
Statements
Formula complexity of a linear function in a \(k\)-ary basis (English)
0 references
8 July 2021
0 references
Boolean formulas
0 references
linear function
0 references
majority function
0 references
Khrapchenko method
0 references
bipartite graphs
0 references
lower bounds for complexity
0 references
0 references