Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure (Q2826061): Difference between revisions

@@ Property / cites work @@
+Effective Strong Dimension in Algorithmic Information and Computational Complexity
+Normal rank
@@ Property / cites work @@
+Q5515914
@@ Property / cites work: Q5515914 / rank @@
+Normal rank
@@ Property / cites work @@
+The Well-Calibrated Bayesian
@@ Property / cites work: The Well-Calibrated Bayesian / rank @@
+Normal rank
@@ Property / cites work @@
+THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES
+Normal rank
@@ Property / cites work @@
+The Complexity of Forecast Testing
@@ Property / cites work: The Complexity of Forecast Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic calibration
@@ Property / cites work: Asymptotic calibration / rank @@
+Normal rank
@@ Property / cites work @@
+Dimension in Complexity Classes
@@ Property / cites work: Dimension in Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+The dimensions of individual strings and sequences
+Normal rank
@@ Property / cites work @@
+Universal prediction
@@ Property / cites work: Universal prediction / rank @@
+Normal rank
@@ Property / cites work @@
+The reproducible properties of correct forecasts
@@ Property / cites work: The reproducible properties of correct forecasts / rank @@
+Normal rank