Real functions, contraction mappings, and P-completeness (Q811127): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: The computational complexity of maximization and integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584384 / 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: Q3833617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible Real Functions and Arithmetic Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035313 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0890-5401(91)90027-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974938461 / rank
 
Normal rank

Latest revision as of 10:15, 30 July 2024

scientific article
Language Label Description Also known as
English
Real functions, contraction mappings, and P-completeness
scientific article

    Statements

    Real functions, contraction mappings, and P-completeness (English)
    0 references
    0 references
    1991
    0 references
    P-completeness
    0 references
    real numbers
    0 references
    continuous functions
    0 references
    Boolean circuit family
    0 references
    \(NC=P\)
    0 references

    Identifiers

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