Pages that link to "Item:Q4441905"
From MaRDI portal
The following pages link to Counting Complexity Classes for Numeric Computations I: Semilinear Sets (Q4441905):
Displaying 4 items.
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety (Q2371309) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Some Results on Interactive Proofs for Real Computations (Q3195685) (← links)
