Computational complexity of real functions
type: Item
instance of: scholarly article
title: Computational complexity of real functions
zbMATH Open document ID: 0498.03047
DOI: 10.1016/S0304-3975(82)80003-0
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 03F60
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3784877
zbMATH Keywords: polynomial time
zbMATH Keywords: NP theory
zbMATH Keywords: oracle Turing machine
zbMATH Keywords: continuity of a real function
zbMATH Keywords: roots
zbMATH Keywords: nowhere differentiable function
zbMATH Keywords: integral
zbMATH Keywords: maximum value
author: Ker-I Ko
author: Harvey M. Friedman
MaRDI profile type: Publication
cites work: Analysis in the Computable Number Field
cites work: Q4091421
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Q5672170
cites work: On the definitions of computable real continuous functions
cites work: Q3260573
cites work: Q5590393
cites work: The maximum value problem and NP real numbers
cites work: Q3227567
cites work: Q3243267
cites work: On computable sequences
cites work: Criteria of constructibility for real numbers
cites work: An Exact Method for Finding the Roots of a Complex Polynomial
cites work: Recursive Real Numbers
cites work: Q5573961
cites work: Q5526189
cites work: Q5556429
cites work: Nicht konstruktiv beweisbare Sätze der Analysis
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem
cites work: A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
full work available at URL: s0304-3975(82)80003-0
OpenAlex ID: W2006786362
description: scientific article; zbMATH DE number 3784877