Lower bounds of complexity for polarized polynomials over finite fields (Q2002473): Difference between revisions

@@ Property / cites work @@
+Minimization of Exclusive or and Logical Equivalence Switching Circuits
+Normal rank
@@ Property / cites work @@
+Reed-Muller Like Canonic Forms for Multivalued Functions
+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 @@
+Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
+Normal rank
@@ Property / cites work @@
+On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized 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 @@
+Lower bound for the complexity of five-valued polarized polynomials
+Normal rank
@@ Property / cites work @@
+Q3216750
@@ Property / cites work: Q3216750 / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of a conjecture by Schweizer on the Drinfeld modular polynomial \(\varPhi _T(X,Y)\)
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s0037446619010014
+Normal rank
@@ Property / OpenAlex ID @@
+W2936880849
@@ Property / OpenAlex ID: W2936880849 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q128114776
@@ Property / Wikidata QID: Q128114776 / rank @@
+Normal rank