Comparing the computational complexity of monomials and elements of finite abelian groups (Q2088733): Difference between revisions

@@ Property / author @@
-Vadim V. Kochergin
@@ Property / author: Vadim V. Kochergin / rank @@
-Normal rank
@@ Property / author @@
+Vadim V. Kochergin
@@ Property / author: Vadim V. Kochergin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4301460
@@ Property / cites work: Q4301460 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Sequences with Addition Chains
@@ Property / cites work: Computing Sequences with Addition Chains / rank @@
+Normal rank
@@ Property / cites work @@
+Q4005480
@@ Property / cites work: Q4005480 / rank @@
+Normal rank
@@ Property / cites work @@
+On some measures of complexity of finite abelian groups
+Normal rank
@@ Property / cites work @@
+Complexity of additive computations of systems of linear forms
+Normal rank
@@ Property / cites work @@
+Q5585021
@@ Property / cites work: Q5585021 / rank @@
+Normal rank
@@ Property / cites work @@
+Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems
+Normal rank
@@ Property / cites work @@
+On Bellman's and Knuth's problems and their generalizations
+Normal rank
@@ Property / cites work @@
+Complexity of Linear Boolean Operators
@@ Property / cites work: Complexity of Linear Boolean Operators / rank @@
+Normal rank
@@ Property / cites work @@
+Q4301392
@@ Property / cites work: Q4301392 / rank @@
+Normal rank
@@ Property / cites work @@
+Remarks on number theory III. On addition chains
@@ Property / cites work: Remarks on number theory III. On addition chains / rank @@
+Normal rank
@@ Property / cites work @@
+Q5672822
@@ Property / cites work: Q5672822 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of computations on monomials and tuples of powers
+Normal rank
@@ Property / cites work @@
+Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.3103/s0027132222030068
+Normal rank
@@ Property / OpenAlex ID @@
+W4293752854
@@ Property / OpenAlex ID: W4293752854 / rank @@
+Normal rank