Complexity of function systems over a finite field in the class of polarized polynomial forms (Q1703296): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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
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: 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 systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms / 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: Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4360230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509721 / rank
 
Normal rank

Revision as of 06:03, 15 July 2024

scientific article
Language Label Description Also known as
English
Complexity of function systems over a finite field in the class of polarized polynomial forms
scientific article

    Statements

    Identifiers