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

@@ Property / author @@
-Luis Miguel Pardo
@@ Property / author: Luis Miguel Pardo / rank @@
-Normal rank
@@ Property / author @@
+Luis Miguel Pardo
@@ Property / author: Luis Miguel Pardo / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q30
@@ Property / Mathematics Subject Classification ID: 68Q30 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+D10
@@ Property / Mathematics Subject Classification ID: 03D10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q05
@@ Property / Mathematics Subject Classification ID: 68Q05 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6590730
@@ Property / zbMATH DE Number: 6590730 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+real computation
@@ Property / zbMATH Keywords: real computation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algebaric complexity theory
@@ Property / zbMATH Keywords: algebaric complexity theory / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+real Turing machines
@@ Property / zbMATH Keywords: real Turing machines / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+straight-line complexity
@@ Property / zbMATH Keywords: straight-line complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Kolmogorov complexity
@@ Property / zbMATH Keywords: Kolmogorov complexity / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:293323