Basic algorithms for rational function fields
From MaRDI portal
Publication:1284279
DOI10.1006/jsco.1998.0246zbMath0935.11046OpenAlexW2066029033MaRDI QIDQ1284279
Jörn Müller-Quade, Rainer Steinwandt
Publication date: 7 May 2000
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1998.0246
Gröbner basisminimal polynomialprimary decompositionsubfieldstranscendence basisrational function fieldcanonical generating setsfield membershipinvolution basistag variables
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Invariants: Computation and Applications ⋮ Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm ⋮ Computation of unirational fields ⋮ Rational invariants of a group action. Construction and rewriting ⋮ The complexity of primes in computable unique factorization domains ⋮ On multivariate rational function decomposition ⋮ Realization theory for rational systems: minimal rational realizations ⋮ Gröbner bases applied to finitely generated field extensions
This page was built for publication: Basic algorithms for rational function fields
