Abstract
In this paper, we discuss several notions of decomposition for multivariate polynomials, focussing on the relation with Luroth's theorem in field theory, and the finiteness and uniqueness of decompositions. We also present two polynomial time algorithms for decomposing (sparse) multivariate polynomials over an arbitrary field.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Applicable Algebra in Engineering, Communication and Computing
Paper Title
Journal
Date
