A simple proof for the upper bound of the computational complexity of three monomials in three variables (Q2320000): Difference between revisions

@@ 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 @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Evaluation of Powers and Monomials
@@ Property / cites work: On the Evaluation of Powers and Monomials / rank @@
+Normal rank
@@ Property / cites work @@
+On Bellman's and Knuth's problems and their generalizations
+Normal rank
@@ Property / cites work @@
+Q3115593
@@ Property / cites work: Q3115593 / rank @@
+Normal rank
@@ Property / cites work @@
+Relation between two measures of the computation complexity for systems of monomials
+Normal rank
@@ Property / cites work @@
+On addition chains
@@ Property / cites work: On addition chains / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.3103/s0027132219020013
+Normal rank
@@ Property / OpenAlex ID @@
+W2944466192
@@ Property / OpenAlex ID: W2944466192 / rank @@
+Normal rank