Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870): Difference between revisions

@@ Property / author @@
+Dima Yu. Grigoriev
@@ Property / author: Dima Yu. Grigoriev / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum complexity theory
@@ Property / cites work: Quantum complexity theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3321411
@@ Property / cites work: Q3321411 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4343414
@@ Property / cites work: Q4343414 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4279514
@@ Property / cites work: Q4279514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227280
@@ Property / cites work: Q4227280 / rank @@
+Normal rank
@@ Property / cites work @@
+Monte-Carlo approximation algorithms for enumeration problems
+Normal rank
@@ Property / cites work @@
+On some approximation problems concerning sparse polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+Quantum computations: algorithms and error correction
+Normal rank
@@ Property / cites work @@
+Q4234292
@@ Property / cites work: Q4234292 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3698903
@@ Property / cites work: Q3698903 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Probabilistic Algorithms for Verification of Polynomial Identities
+Normal rank