Pages that link to "Item:Q1822978"

The following pages link to On the representation of rational functions of bounded complexity (Q1822978):

Displaying 16 items.

• On rational functions of first-class complexity (Q327094) (← links)
• An affine representation of de Casteljau's and de Boor's rational algorithms (Q687448) (← links)
• An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
• Complexity bounds in elimination theory -- a survey. (Q1565824) (← links)
• The Projective Noether Maple Package: Computing the dimension of a projective variety (Q1587230) (← links)
• Lower bounds for the complexity of polynomials (Q1822977) (← links)
• Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
• Effective Pila-Wilkie bounds for unrestricted Pfaffian surfaces (Q2235231) (← links)
• On the efficiency of effective Nullstellensätze (Q2366723) (← links)
• Introduction to rational functions (Q2852155) (← links)
• A Lower Bound for the Formula Size of Rational Functions (Q3692861) (← links)
• Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Q3759937) (← links)
• (Q4636560) (← links)
• On the upper bounds for complexities of discrete functions (Q5876808) (← links)
• A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
• A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)