Pages that link to "Item:Q1148670"

The following pages link to Lower bounds for polynomials with algebraic coefficients (Q1148670):

Displaying 17 items.

• On Kolmogorov complexity in the real Turing machine setting (Q293323) (← links)
• Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
• On the algebraic complexity of rational iteration procedures (Q811125) (← links)
• Lower bounds in algebraic computational complexity (Q1057648) (← links)
• On polynomials with symmetric Galois group which are easy to compute (Q1098889) (← links)
• Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
• Some polynomials that are hard to compute (Q1143788) (← links)
• On the additive complexity of polynomials (Q1157163) (← links)
• Invariant and geometric aspects of algebraic complexity theory. I (Q1176389) (← links)
• Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz (Q1358930) (← links)
• Simplified lower bounds for polynomials with algebraic coefficients (Q1361874) (← links)
• On the representation of rational functions of bounded complexity (Q1822978) (← links)
• Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
• A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
• Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
• Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
• (Q5092471) (← links)