What is the complexity of ill-posed problems? (Q3757277): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Arthur G. Werschulz / rank
Normal rank
 
Property / author
 
Property / author: Arthur G. Werschulz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/01630568708816268 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975181159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How powerful is continuous nonlinear information for linear problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can adaption help on the average? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case optimal algorithms in Hilbert spaces / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:14, 17 June 2024

scientific article
Language Label Description Also known as
English
What is the complexity of ill-posed problems?
scientific article

    Statements

    What is the complexity of ill-posed problems? (English)
    0 references
    1987
    0 references
    finite error
    0 references
    ill-posed linear problems
    0 references
    worst-case
    0 references
    average-case
    0 references
    optimal information
    0 references
    Fredholm problem of the first kind
    0 references
    optimal algorithms
    0 references
    computational complexity
    0 references

    Identifiers

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