scientific article
From MaRDI portal
zbMATH Open0667.68054MaRDI QIDQ3820004FDOQ3820004
Publication date: 1987
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)
Cited In (16)
- Algorithmic Polynomials
- Algorithmic polynomials
- Systole length in hyperbolic \(n\)-manifolds
- Complexity of factoring and calculating the GCD of linear ordinary differential operators
- Weak Bézout inequality for D-modules
- Universal stratifications and a Bertini-type theorem
- Complexity of deciding Tarski algebra
- Polynomial algorithms in computer algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Loewy and primary decompositions of \(\mathcal D\)-modules
- Solving systems of polynomial inequalities in subexponential time
- Title not available (Why is that?)
- Algebraic complexity of computing polynomial zeros
- Title not available (Why is that?)
- Computation in polynomial algebras and ideals
Recommendations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3820004)