Pages that link to "Item:Q3310597"

The following pages link to On the definitions of some complexity classes of real numbers (Q3310597):

Displaying 27 items.

• The computational complexity of distance functions of two-dimensional domains (Q557838) (← links)
• Real numbers, continued fractions and complexity classes (Q751655) (← links)
• Reducibilities on real numbers (Q795039) (← links)
• Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546) (← links)
• Représentations des nombres réels par développements en base entière et complexité. (Representations of real numbers by expansions on integer basis and complexity) (Q804571) (← links)
• Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
• On the continued fraction representation of computable real numbers (Q1096627) (← links)
• Representations of the real numbers and of the open subsets of the set of real numbers (Q1101448) (← links)
• The maximum value problem and NP real numbers (Q1161742) (← links)
• Some observations on NP real numbers and P-selective sets (Q1164623) (← links)
• Average case completeness (Q1176231) (← links)
• A note of best fractions of a computable real number (Q1201155) (← links)
• Complete distributional problems, hard languages, and resource-bounded measure (Q1575682) (← links)
• Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval (Q1589441) (← links)
• Complexity of the calculus of continued fraction representation of real numbers (Q1814099) (← links)
• On the computational complexity of best Chebyshev approximations (Q1821775) (← links)
• Using PVS to validate the algorithms of an exact arithmetic. (Q1853641) (← links)
• Randomness and reducibility (Q1878680) (← links)
• On the complexity of conversion between classic real number representations (Q2106593) (← links)
• Dedekind cuts and long strings of zeros in base expansions (Q2117788) (← links)
• Computable irrational numbers with representations of surprising complexity (Q2216036) (← links)
• In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
• On the complexity of computable real sequences (Q3773335) (← links)
• Primitive Recursiveness of Real Numbers under Different Representations (Q4921448) (← links)
• Computability of Real Numbers (Q5024567) (← links)
• Weakly computable real numbers (Q5925970) (← links)
• On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)