Real computations with fake numbers (Q1599196): 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.2001.0607 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992313960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial and algebraic complexity of quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logical theories / 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: On the Complexity of Quantifier Elimination: the Structural Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Real Turing Machines over Binary Inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234080 / 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: Logics which capture complexity classes over the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of complexity classes in Koiran's weak model / 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: Towards a formal definition of numerical stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348513 / 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: Q4186267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234078 / 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: Q4864704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity and Numerical Stability / 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: Q5829318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Polynomial Equation: Some History and Recent Progress / 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: 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: Linear programming, complexity theory and elementary functional analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's Theorem I: Geometric Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135179 / 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: Complexity of Bezout's theorem. V: Polynomial time / 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: The fundamental theorem of algebra and complexity theory / 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: Q4356579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-Case Stability of Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a theorem of Blum, Shub, and Smale / rank
 
Normal rank
Property / cites work
 
Property / cites work: ROUNDING-OFF ERRORS IN MATRIX PROCESSES / 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: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Error Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical stability for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717973 / rank
 
Normal rank

Latest revision as of 10:22, 4 June 2024

scientific article
Language Label Description Also known as
English
Real computations with fake numbers
scientific article

    Statements

    Real computations with fake numbers (English)
    0 references
    0 references
    16 February 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    numerical analysis under complete information
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references