On the complexity of solving feasible systems of linear inequalities specified with approximate data (Q1919805): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: On Perturbations in Systems of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On condition numbers and the distance to the nearest ill-posed problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of linear algebraic equations with interval coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation Analysis of a Condition Number for Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Condition Number for Differentiable Convex Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perturbation theory for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for error in the solution set of a perturbed linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability Theory for Systems of Inequalities. Part I: Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of linear interval equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Remarks on the Foundations of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: ROUNDING-OFF ERRORS IN MATRIX PROCESSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical inverting of matrices of high order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871634 / rank
 
Normal rank

Latest revision as of 12:43, 24 May 2024

scientific article
Language Label Description Also known as
English
On the complexity of solving feasible systems of linear inequalities specified with approximate data
scientific article

    Statements

    On the complexity of solving feasible systems of linear inequalities specified with approximate data (English)
    0 references
    0 references
    28 July 1996
    0 references
    condition measures
    0 references
    approximate solution
    0 references
    system of linear inequalities
    0 references
    approximate data
    0 references

    Identifiers