On Kolmogorov complexity in the real Turing machine setting (Q293323): Difference between revisions

@@ Property / cites work @@
+On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
+Normal rank
@@ Property / cites work @@
+Q4372496
@@ Property / cites work: Q4372496 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3280357
@@ Property / cites work: Q3280357 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4331740
@@ Property / cites work: Q4331740 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds in algebraic computational complexity
+Normal rank
@@ Property / cites work @@
+Q3835021
@@ Property / cites work: Q3835021 / rank @@
+Normal rank
@@ Property / cites work @@
+On the intrinsic complexity of elimination theory
@@ Property / cites work: On the intrinsic complexity of elimination theory / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for polynomials with algebraic coefficients
+Normal rank
@@ Property / cites work @@
+Q3496299
@@ Property / cites work: Q3496299 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385509
@@ Property / cites work: Q4385509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4352783
@@ Property / cites work: Q4352783 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
+Normal rank
@@ Property / cites work @@
+Polynomials with Rational Coefficients Which are Hard to Compute
+Normal rank
@@ Property / cites work @@
+Some polynomials that are hard to compute
@@ Property / cites work: Some polynomials that are hard to compute / rank @@
+Normal rank
@@ Property / cites work @@
+Q5798024
@@ Property / cites work: Q5798024 / rank @@
+Normal rank