Upper bound for the length of functions over a finite field in the class of pseudopolynomials (Q2401117): 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: Svetlana N. Selezneva / rank
Normal rank
 
Property / author
 
Property / author: Svetlana N. Selezneva / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Boolean functions in the class of canonical polarized polynomials / 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: An upper bound for complexity of polynomial normal forms of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of representation of multiple-valued logic functions as polarised polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of polarised polynomials of multi-valued logic functions in one variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of generalized polynomials of \(k\)-valued functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of representation of k-valued functions by generalised polarised polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the length of functions of \(k\)-valued logic in the class of polynomial normal forms modulo \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On upper bound of the complexity of quasi polynomial representations of functions over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4360230 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0965542517050116 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2623457905 / rank
 
Normal rank

Latest revision as of 09:25, 30 July 2024

scientific article
Language Label Description Also known as
English
Upper bound for the length of functions over a finite field in the class of pseudopolynomials
scientific article

    Statements

    Upper bound for the length of functions over a finite field in the class of pseudopolynomials (English)
    0 references
    31 August 2017
    0 references
    function over a finite field
    0 references
    polynomial form
    0 references
    exclusive-OR sum of pseudoproducts
    0 references
    length
    0 references
    upper bound
    0 references

    Identifiers