Computational complexity of real functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3113501 (Why is no real title available?)
- scientific article; zbMATH DE number 3127537 (Why is no real title available?)
- scientific article; zbMATH DE number 3143694 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3238721 (Why is no real title available?)
- scientific article; zbMATH DE number 3271504 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3309631 (Why is no real title available?)
- scientific article; zbMATH DE number 3407149 (Why is no real title available?)
- A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
- A Machine-Independent Theory of the Complexity of Recursive Functions
- An Exact Method for Finding the Roots of a Complex Polynomial
- Analysis in the Computable Number Field
- Criteria of constructibility for real numbers
- Nicht konstruktiv beweisbare Sätze der Analysis
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On computable sequences
- On the definitions of computable real continuous functions
- Recursive Real Numbers
- The maximum value problem and NP real numbers
Cited in
(80)- On the complexity of computing the Hausdorff distance
- Approximation to measurable functions and its relation to probabilistic computation
- Real functions, contraction mappings, and P-completeness
- The complexity of generating test instances
- Normality in non-integer bases and polynomial time randomness
- On approximate and algebraic computability over the real numbers
- Computational complexity of classical solutions of partial differential equations
- On the complexity of conversion between classic real number representations
- On the continued fraction representation of computable real numbers
- Presentations of computably enumerable reals.
- The computational complexity of maximization and integration
- Effective metric spaces and representations of the reals.
- Computing power series in polynomial time
- Parametrised second-order complexity theory with applications to the study of interval computation
- On continuous one-way functions
- Complexity of operators on compact sets
- Computability on computable metric spaces
- On the time complexity of partial real functions
- Curves that must be retraced
- On subrecursive complexity of integration
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
- Characterizing time computational complexity classes with polynomial differential equations
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions.
- Analytical properties of resource-bounded real functionals
- A polynomial-time computable curve whose interior has a nonrecursive measure
- Fixed points on the real numbers without the equality test
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Relatively recursive reals and real functions
- Computable metrics above the standard real metric
- On the computational complexity of best Chebyshev approximations
- Representations and evaluation strategies for feasibly approximable functions
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
- On the computational complexity of the Dirichlet problem for Poisson's equation
- Average-case polynomial-time computability of Hamiltonian dynamics
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
- Real functions computable by finite automata using affine representations.
- COMPUTABLY COMPACT METRIC SPACES
- On the complexity of computing the logarithm and square root functions on a complex domain
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
- Computability structure of the Sobolev spaces and its applications
- Structure in average case complexity
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Computable preference and utility
- Recursive characterization of computable real-valued functions and relations
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Hierarchies of function classes defined by the first-value operator
- Solovay reducibility and continuity
- Some properties of sets tractable under every polynomial-time computable distribution
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Exponential lower bounds for finding Brouwer fixed points
- Uniformity of quantum circuit families for error-free algorithms
- European Summer Meeting of the Association for Symbolic Logic
- Sets computable in polynomial time on average
- In Memoriam: Ker-I Ko (1950–2018)
- On the complexity of online computations of real functions
- Computer Science for Continuous Data
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality
- Continuous optimization problems and a polynomial hierarchy of real functions
- Étude constructive de problèmes de topologie pour les réels irrationnels
- Trivial Reals
- On the computational complexity of integral equations
- Reducibilities on real numbers
- On the definitions of some complexity classes of real numbers
- Theory of representations
- The maximum value problem and NP real numbers
- scientific article; zbMATH DE number 7407778 (Why is no real title available?)
- Complexity of the calculus of continued fraction representation of real numbers
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Grzegorczyk's hierarchy of computable analysis
- Polynomial time samplable distributions
- Multi-resolution cellular automata for real computation
- Effectively closed sets and graphs of computable real functions.
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Type 2 computational complexity of functions on Cantor's space
- The Hausdorff-Ershov hierarchy in Euclidean spaces
- On parallel complexity of analytic functions
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- On the complexity of computable real sequences
This page was built for publication: Computational complexity of real functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1171056)
