Pages that link to "Item:Q3549316"
From MaRDI portal
The following pages link to On Computational Complexity of Semilinear Varieties (Q3549316):
Displaying 12 items.
- The complexity of semilinear problems in succinct representation (Q862341) (← links)
- Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
- On the complexity of semidefinite programs (Q1361073) (← links)
- Proof search and co-NP completeness for many-valued logics (Q1697337) (← links)
- Computational complexity of learning algebraic varieties (Q2221768) (← links)
- On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$ (Q2807870) (← links)
- (Q3754444) (← links)
- Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity (Q4005386) (← links)
- (Q4361549) (← links)
- (Q4721662) (← links)
- Low Growth Equational Complexity (Q5228210) (← links)
- (Q6041403) (← links)