On Computational Complexity of Semilinear Varieties
From MaRDI portal
Recommendations
Cited in
(12)- Complexity of computing the local dimension of a semialgebraic set
- On the complexity of semidefinite programs
- Proof search and co-NP completeness for many-valued logics
- Computational complexity of learning algebraic varieties
- On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$
- scientific article; zbMATH DE number 4001882 (Why is no real title available?)
- Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity
- scientific article; zbMATH DE number 1080058 (Why is no real title available?)
- scientific article; zbMATH DE number 3995073 (Why is no real title available?)
- Low growth equational complexity
- scientific article; zbMATH DE number 7689792 (Why is no real title available?)
- The complexity of semilinear problems in succinct representation
This page was built for publication: On Computational Complexity of Semilinear Varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549316)