Pages that link to "Item:Q1284279"
From MaRDI portal
The following pages link to Basic algorithms for rational function fields (Q1284279):
Displaying 13 items.
- On multivariate rational function decomposition (Q697481) (← links)
- Computing primitive elements of extension fields (Q911775) (← links)
- Realization theory for rational systems: minimal rational realizations (Q970469) (← links)
- Recognizing simple subextensions of purely transcendental field extensions (Q1583884) (← links)
- Gröbner bases applied to finitely generated field extensions (Q1588034) (← links)
- The complexity of primes in computable unique factorization domains (Q1750293) (← links)
- Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence (Q1823681) (← links)
- Freeness, linear disjointness, and implicitization -- a classical approach. (Q1975385) (← links)
- Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm (Q2457340) (← links)
- Computation of unirational fields (Q2457397) (← links)
- Rational invariants of a group action. Construction and rewriting (Q2457418) (← links)
- (Q4394974) (← links)
- Algorithm for globally identifiable reparametrizations of ODEs (Q6650568) (← links)