Computational complexity of real functions (Q1171056): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ker-I. Ko / rank
Normal rank
 
Property / author
 
Property / author: Harvey M. Friedman / rank
Normal rank
 
Property / author
 
Property / author: Ker-I. Ko / rank
 
Normal rank
Property / author
 
Property / author: Harvey M. Friedman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis in the Computable Number Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definitions of computable real continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3260573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum value problem and NP real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3227567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computable sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Criteria of constructibility for real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Method for Finding the Roots of a Complex Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Real Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nicht konstruktiv beweisbare Sätze der Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(82)80003-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006786362 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Computational complexity of real functions
scientific article

    Statements

    Computational complexity of real functions (English)
    0 references
    1982
    0 references
    polynomial time
    0 references
    NP theory
    0 references
    oracle Turing machine
    0 references
    continuity of a real function
    0 references
    roots
    0 references
    nowhere differentiable function
    0 references
    integral
    0 references
    maximum value
    0 references
    0 references
    0 references

    Identifiers