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

@@ Property / author @@
-Aleksandr Sergeevich Balyuk
@@ Property / author: Aleksandr Sergeevich Balyuk / rank @@
-Normal rank
@@ Property / author @@
-Anna Sergeevna Zinchenko
@@ Property / author: Anna Sergeevna Zinchenko / rank @@
-Normal rank
@@ Property / author @@
+Aleksandr Sergeevich Balyuk
@@ Property / author: Aleksandr Sergeevich Balyuk / rank @@
+Normal rank
@@ Property / author @@
+Anna Sergeevna Zinchenko
@@ Property / author: Anna Sergeevna Zinchenko / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1515/dma-2017-0029
+Normal rank
@@ Property / OpenAlex ID @@
+W2763549749
@@ Property / OpenAlex ID: W2763549749 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Boolean functions in the class of polarized polynomial forms
+Normal rank
@@ Property / cites work @@
+On complexity of representation of multiple-valued logic functions as polarised polynomials
+Normal rank
@@ Property / cites work @@
+A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials
+Normal rank
@@ Property / cites work @@
+Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
+Normal rank