Complexity lower bound for Boolean functions in the class of extended operator forms (Q2306843): Difference between revisions

@@ Property / describes a project that uses @@
+OEIS
@@ Property / describes a project that uses: OEIS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2997867077
@@ Property / OpenAlex ID: W2997867077 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds of complexity for polarized polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+Q4382830
@@ Property / cites work: Q4382830 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Boolean functions' representations in classes of extended pair-generated operator forms
+Normal rank
@@ Property / cites work @@
+Q2748260
@@ Property / cites work: Q2748260 / rank @@
+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 @@
+Complexity of Boolean functions in the class of polarized polynomial forms
+Normal rank
@@ Property / cites work @@
+Upper bound for the length of functions over a finite field in the class of pseudopolynomials
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2306843