Pages that link to "Item:Q1822978"
From MaRDI portal
The following pages link to On the representation of rational functions of bounded complexity (Q1822978):
Displayed 8 items.
- 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)
- On the efficiency of effective Nullstellensätze (Q2366723) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
- A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)