A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: mctoolbox / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963573218 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1403.6241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exotic quantifiers, complexity classes, and complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing over the reals with addition and order: Higher complexity classes / 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: \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) / 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: Some perturbation theory for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linear homotopy to find approximate zeros of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem posed by Steve Smale / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smale’s 17th problem: Average polynomial time to compute affine and projective solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new condition number for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverage processes on spheres and condition numbers for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity and Numerical Stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing over the reals with addition and order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la complexité du principe de Tarski-Seidenberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Comments from a Numerical Analyst / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / 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: The Relaxation Method for Solving Systems of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: ROUNDING-OFF ERRORS IN MATRIX PROCESSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and Condition Numbers of Random Matrices / 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: Some Remarks on the Foundations of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two \(P\)-complete problems in the theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. V: Polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity estimates depending on condition and round-off error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. III: Condition number and packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical algorithm for zero counting. I: Complexity and accuracy / rank
 
Normal rank

Latest revision as of 19:21, 9 July 2024

scientific article; zbMATH DE number 6413668
Language Label Description Also known as
English
A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
scientific article; zbMATH DE number 6413668

    Statements

    A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (English)
    0 references
    0 references
    11 March 2015
    0 references
    0 references
    0 references

    Identifiers

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