Lower bound for the complexity of five-valued polarized polynomials (Q1744288): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/dma-2017-0029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2763549749 / 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
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: Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms / rank
 
Normal rank

Latest revision as of 13:47, 15 July 2024

scientific article
Language Label Description Also known as
English
Lower bound for the complexity of five-valued polarized polynomials
scientific article

    Statements