Pages that link to "Item:Q2643147"
From MaRDI portal
The following pages link to Computing minimal multi-homogeneous Bezout numbers is hard (Q2643147):
Displaying 8 items.
- The m-Bézout bound and distance geometry (Q831957) (← links)
- Bézout number calculations for multi-homogeneous polynomial systems (Q1200228) (← links)
- Heuristic methods for computing the minimal multi-homogeneous Bézout number. (Q1412521) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs (Q2025442) (← links)
- Minimizing multi-homogeneous Bézout numbers by a local search method (Q2701563) (← links)
- STACS 2005 (Q5710679) (← links)
- Dimension results for extremal-generic polynomial systems over complete toric varieties (Q6196136) (← links)