Computing minimal multi-homogeneous Bezout numbers is hard

DOI10.1007/S00224-006-1322-YMaRDI QIDQ2643147zbMATH OpenOpenAlexFDO

Authors Gregorio Malajovich, Klaus Meer

Publication date 23 August 2007

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-006-1322-y

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• STACS 2005
• Bézout number calculations for multi-homogeneous polynomial systems
• Computing the optimal partition of variables in multi-homogeneous homotopy methods
• Minimizing multi-homogeneous Bézout numbers by a local search method
• Heuristic methods for computing the minimal multi-homogeneous Bézout number.

Cited in

(9)

• Bézout number calculations for multi-homogeneous polynomial systems
• Heuristic methods for computing the minimal multi-homogeneous Bézout number.
• Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
• On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
• Minimizing multi-homogeneous Bézout numbers by a local search method
• A Product-Decomposition Bound for Bezout Numbers
• STACS 2005
• Dimension results for extremal-generic polynomial systems over complete toric varieties
• The m-Bézout bound and distance geometry

This page was built for publication: Computing minimal multi-homogeneous Bezout numbers is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643147)