Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials (Q332332): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11T99 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11T06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11Y16 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6648823 / rank
 
Normal rank
Property / zbMATH Keywords
 
finite field
Property / zbMATH Keywords: finite field / rank
 
Normal rank
Property / zbMATH Keywords
 
polarized polynomial
Property / zbMATH Keywords: polarized polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
Kronecker form
Property / zbMATH Keywords: Kronecker form / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bounds
Property / zbMATH Keywords: lower bounds / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q4320535 / 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: Complexity of Boolean functions in the class of polarized polynomial forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of representation of multiple-valued logic functions as polarised polynomials / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:09, 12 July 2024

scientific article
Language Label Description Also known as
English
Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references