The maximum value problem and NP real numbers (Q1161742): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4160434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3260573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4122837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definitions of some complexity classes of real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Abstract Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / 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: The polynomial-time hierarchy / rank
 
Normal rank

Latest revision as of 14:12, 13 June 2024

scientific article
Language Label Description Also known as
English
The maximum value problem and NP real numbers
scientific article

    Statements

    The maximum value problem and NP real numbers (English)
    0 references
    1982
    0 references
    NP computable real number
    0 references
    maximum value of a continuous polynomial time computable real function
    0 references
    NP sets over a single-letter alphabet
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references