Formula complexity of a linear function in a \(k\)-ary basis (Q2037681): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Igor S. Sergeev / rank
Normal rank
 
Property / author
 
Property / author: Igor S. Sergeev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of determining lower bounds for the complexity of \(\Pi\)-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4772712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of realization of the linear function by formulas over finite Boolean bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circuits of functional elements of finite depth of branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which bases admit non-trivial shrinkage of formulae? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization of linear functions by formulas in various bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formula Complexity of Ternary Majorities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the formula size of symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and depth of formulas for symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using amplification to compute majority with small majority gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4758141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036708 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0001434621030123 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3181531192 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

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

    Identifiers