Pages that link to "Item:Q3783550"
From MaRDI portal
The following pages link to Greatest common divisors of polynomials given by straight-line programs (Q3783550):
Displayed 21 items.
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Sparse interpolation of multivariate rational functions (Q633622) (← links)
- Evaluation properties of invariant polynomials (Q731933) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Interpolation of polynomials given by straight-line programs (Q1029336) (← links)
- On fast multiplication of polynomials over arbitrary algebras (Q1186518) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Parallel evaluation of arithmetic circuits (Q1365929) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs (Q1404687) (← links)
- Complexity bounds in elimination theory -- a survey. (Q1565824) (← links)
- Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
- A quasi-linear irreducibility test in \(\mathbb{K}[[x]][y]\) (Q2149947) (← links)
- Sparse polynomial interpolation based on derivatives (Q2156377) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2353409) (← links)
- The complexity of two problems on arithmetic circuits (Q2465637) (← links)
- Computing generators of the ideal of a smooth affine algebraic variety (Q2643543) (← links)
- CATEGORICAL COMPLEXITY (Q3304647) (← links)
- (Q5092488) (← links)