Pages that link to "Item:Q2489141"

The following pages link to Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141):

Displaying 18 items.

• A complex analogue of Toda's theorem (Q454132) (← links)
• Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
• On a generalization of Stickelberger's theorem (Q607067) (← links)
• Computing the homology of real projective sets (Q667646) (← links)
• Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time (Q937274) (← links)
• Computing the first Betti number of a semi-algebraic set (Q937278) (← links)
• A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
• Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
• On the complexity of counting components of algebraic varieties (Q1030247) (← links)
• Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
• Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
• A complexity theory of constructible functions and sheaves (Q2340508) (← links)
• On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety (Q2371309) (← links)
• Computing the first few Betti numbers of semi-algebraic sets in single exponential time (Q2457390) (← links)
• Some Results on Interactive Proofs for Real Computations (Q3195685) (← links)
• Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
• On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
• Beyond the Existential Theory of the Reals (Q6489317) (← links)