Complexity of linear problems with a fixed output basis (Q1977152): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcom.1999.0538 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056443473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of linear methods for operator approximation in convex classes of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4356573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal sequential and non-sequential procedures for evaluating a functional / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3709786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological complexity with continuous operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: s-numbers in information-based complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real number model in numerical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of adaption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological complexity of zero-finding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cost of uniform and nonuniform algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the topology of algorithms. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are linear algorithms always good for linear problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why does information-based complexity use the real number model? / rank
 
Normal rank

Revision as of 14:59, 29 May 2024

scientific article
Language Label Description Also known as
English
Complexity of linear problems with a fixed output basis
scientific article

    Statements

    Complexity of linear problems with a fixed output basis (English)
    0 references
    9 May 2000
    0 references
    information-based complexity
    0 references
    0 references
    0 references

    Identifiers