The following pages link to Counting problems over the reals (Q1575534):
Displaying 10 items.
- A complex analogue of Toda's theorem (Q454132) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918401) (← links)
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918795) (← links)
- Semiring reasoning frameworks in AI and their computational complexity (Q6488781) (← links)
