Pages that link to "Item:Q4109195"

The following pages link to On the Number of Additions to Compute Specific Polynomials (Q4109195):

Displaying 14 items.

• On homotopy types of limits of semi-algebraic sets and additive complexity of polynomials (Q466903) (← links)
• Some aspects of complexity in real algebraic geometry (Q582342) (← links)
• Lower bounds in algebraic computational complexity (Q1057648) (← links)
• Lower bounds for polynomials with algebraic coefficients (Q1148670) (← links)
• On the additive complexity of polynomials (Q1157163) (← links)
• Complexity measures and hierarchies for the evaluation of integers and polynomials (Q1241288) (← links)
• Evaluation of polynomials with super-preconditioning (Q1243131) (← links)
• On the representation of rational functions of bounded complexity (Q1822978) (← links)
• On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\). (Q1923773) (← links)
• On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem (Q2256583) (← links)
• Intersection multiplicity of a sparse curve and a low-degree curve (Q2301455) (← links)
• A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
• Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
• Shadows of Newton polytopes (Q6076195) (← links)