scientific article; zbMATH DE number 3627285

zbMATH Open0404.10030MaRDI QIDQ4189352FDOQ4189352

Authors: Gennady A. Noskov 

Publication date: 1978

Full work available at URL: https://eudml.org/doc/61848

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

Recommendations

• Decidable Sentences Over Polynomial Rings
• scientific article; zbMATH DE number 1422919
• Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
• scientific article; zbMATH DE number 1990793
• scientific article; zbMATH DE number 1567883

zbMATH Keywords

algorithmpolynomial ringdecidabilitypolynomial

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials (irreducibility, etc.) (11R09) Decidability (number-theoretic aspects) (11U05)

Cited In (5)

• Algorithmic problems for differential polynomial algebras
• Differential algebraic dependence and Novikov dependence
• Algorithmic problems in associative algebras
• Poisson brackets and two-generated subalgebras of rings of polynomials
• The tame and the wild automorphisms of polynomial rings in three variables

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