Computing the homology of real projective sets (Q667646): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10208-017-9358-8 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1602.02094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case complexity without the black swans / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the first Betti number of a semi-algebraic set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / 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: Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets / 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: Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving linear programs with finite precision. II: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate zeros and condition numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of some condition numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical algorithm for zero counting. I: Complexity and accuracy / 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. III: Randomization and condition / 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 estimates depending on condition and round-off error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heights of varieties in multiprojective spaces and arithmetic Nullstellensatze / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probability That a Numerical Analysis Problem is Difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity theory of numerical linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the volume of tubular neighborhoods of real algebraic varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the homology of submanifolds with high confidence from random samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Instability of Resultant Methods for Multidimensional Rootfinding / 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: On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety / rank
 
Normal rank
Property / cites work
 
Property / cites work: Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties / 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: Q4720691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137157 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10208-017-9358-8 / rank
 
Normal rank

Latest revision as of 00:26, 10 December 2024

scientific article
Language Label Description Also known as
English
Computing the homology of real projective sets
scientific article

    Statements

    Computing the homology of real projective sets (English)
    0 references
    0 references
    0 references
    0 references
    1 March 2019
    0 references
    real projective varieties
    0 references
    homology groups
    0 references
    complexity
    0 references
    condition
    0 references
    exponential time
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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