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

@@ Property / DOI @@
-.1007/s10208-017-9358-8
@@ Property / DOI: 10.1007/s10208-017-9358-8 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+CHomP
@@ Property / describes a project that uses: CHomP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2962955948
@@ Property / OpenAlex ID: W2962955948 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02094
@@ Property / arXiv ID: 1602.02094 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3998344
@@ Property / cites work: Q3998344 / rank @@
+Normal rank
@@ Property / cites work @@
+Average-case complexity without the black swans
@@ Property / cites work: Average-case complexity without the black swans / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time
+Normal rank
@@ Property / cites work @@
+Computing the first Betti number of a semi-algebraic set
+Normal rank
@@ Property / cites work @@
+Q4871782
@@ Property / cites work: Q4871782 / rank @@
+Normal rank
@@ Property / cites work @@
+COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
@@ Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank @@
+Normal rank
@@ Property / cites work @@
+On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
+Normal rank
@@ Property / cites work @@
+Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
+Normal rank
@@ Property / cites work @@
+Exotic quantifiers, complexity classes, and complete problems
+Normal rank
@@ Property / cites work @@
+Condition
@@ Property / cites work: Condition / rank @@
+Normal rank
@@ Property / cites work @@
+Solving linear programs with finite precision. II: Algorithms
+Normal rank
@@ Property / cites work @@
+Q4079605
@@ Property / cites work: Q4079605 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate zeros and condition numbers
@@ Property / cites work: Approximate zeros and condition numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Smoothed analysis of some condition numbers
@@ Property / cites work: Smoothed analysis of some condition numbers / rank @@
+Normal rank
@@ Property / cites work @@
+A numerical algorithm for zero counting. I: Complexity and accuracy
+Normal rank
@@ Property / cites work @@
+A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis
+Normal rank
@@ Property / cites work @@
+A numerical algorithm for zero counting. III: Randomization and condition
+Normal rank
@@ Property / cites work @@
+A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
+Normal rank
@@ Property / cites work @@
+Complexity estimates depending on condition and round-off error
+Normal rank
@@ Property / cites work @@
+Heights of varieties in multiprojective spaces and arithmetic Nullstellensatze
+Normal rank
@@ Property / cites work @@
+The Probability That a Numerical Analysis Problem is Difficult
+Normal rank
@@ Property / cites work @@
+Q3655278
@@ Property / cites work: Q3655278 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity theory of numerical linear algebra
@@ Property / cites work: Complexity theory of numerical linear algebra / rank @@
+Normal rank
@@ Property / cites work @@
+On the volume of tubular neighborhoods of real algebraic varieties
+Normal rank
@@ Property / cites work @@
+Finding the homology of submanifolds with high confidence from random samples
+Normal rank
@@ Property / cites work @@
+Numerical Instability of Resultant Methods for Multidimensional Rootfinding
+Normal rank
@@ 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
+Normal rank
@@ Property / cites work @@
+Some perturbation theory for linear programming
@@ Property / cites work: Some perturbation theory for linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Incorporating Condition Measures into the Complexity Theory of Linear Programming
+Normal rank
@@ Property / cites work @@
+Linear programming, complexity theory and elementary functional analysis
+Normal rank
@@ Property / cites work @@
+On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
+Normal rank
@@ Property / cites work @@
+Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's Theorem I: Geometric Aspects
+Normal rank
@@ Property / cites work @@
+Q3135179
@@ Property / cites work: Q3135179 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's theorem. III: Condition number and packing
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's theorem. V: Polynomial time
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
+Normal rank
@@ Property / cites work @@
+Q4720691
@@ Property / cites work: Q4720691 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227352
@@ Property / cites work: Q4227352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4137157
@@ Property / cites work: Q4137157 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10208-017-9358-8
@@ Property / DOI: 10.1007/S10208-017-9358-8 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:667646