scientific article; zbMATH DE number 6868511

zbMATH Open1387.13056MaRDI QIDQ4639978

Alkiviadis G. Akritas

Publication date: 15 May 2018

Full work available at URL: http://serdica-comp.math.bas.bg/index.php/serdicajcomputing/article/view/242

Title of this publication is not available (Why is that?)

zbMATH Keywords

Sylvester's matricespseudo remainderssubresultant PRS's

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)

Related Items (1)

Title not available (Why is that?)

Uses Software

• Title not available (Why is that?)

Recommendations

• A theory and an algorithm for computing sparse multivariate polynomial remainder sequence 👍 👎
• A new method for computing polynomial greatest common divisors and polynomial remainder sequences 👍 👎
• Matrix computation of subresultant polynomial remainder sequences in integral domains 👍 👎
• An alternative algorithm for computing the pseudo-remainder of multivariate polynomials 👍 👎
• A subresultant based subspace method for the computation of polynomial GCDs 👍 👎
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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 Q4639978)