Pages that link to "Item:Q3580991"
From MaRDI portal
The following pages link to Counting complexity classes for numeric computations II (Q3580991):
Displaying 10 items.
- A complex analogue of Toda's theorem (Q454132) (← links)
- On the complexity of \(p\)-adic basic semi-algebraic sets (Q883331) (← links)
- Counting problems over the reals (Q1575534) (← links)
- The complexity to compute the Euler characteristic of complex varieties (Q1886973) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Counting complexity classes for numeric computations. III: Complex projective sets (Q2505650) (← links)
- On numerical invariants in algebraic complexity theory (Q2922530) (← links)
- Two logical hierarchies of optimization problems over the real numbers (Q3376539) (← links)
- Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity (Q4005386) (← links)