Pages that link to "Item:Q1734694"

The following pages link to On the bit complexity of polynomial system solving (Q1734694):

Displaying 11 items.

• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
• Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
• On the cell probe complexity of polynomial evaluation (Q673647) (← links)
• On solving hard problems by polynomial-size circuits (Q1095663) (← links)
• Message length effects for solving polynomial systems on a hypercube (Q1121641) (← links)
• Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
• Bit-complexity of solving systems of linear evolutionary partial differential equations (Q2117092) (← links)
• On the complexity exponent of polynomial system solving (Q2658549) (← links)
• (Q3421275) (← links)
• On the complexity of Chow and Hurwitz forms (Q6536635) (← links)
• Interpolation by decomposable univariate polynomials (Q6614422) (← links)