Some decision problems for polynomial mappings

DOI10.1016/0304-3975(78)90010-5MaRDI QIDQ1248614zbMATH OpenOpenAlexFDO

Authors Dorothy Bollman, Miguel L. Laplaza

Publication date 1978

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(78)90010-5

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Higher degree equations; Fermat's equation (11D41) Decidability (number-theoretic aspects) (11U05)

Cites work

• scientific article; zbMATH DE number 3255057 (Why is no real title available?)
• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• scientific article; zbMATH DE number 3050844 (Why is no real title available?)
• Allocating Storage for Extendible Arrays
• An unsolvable problem in number theory
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Data graphs and addressing schemes
• Hilbert's Tenth Problem is Unsolvable
• Managing Storage for Extendible Arrays
• Preserving Proximity in Arrays
• The decision problem for exponential diophantine equations

This page was built for publication: Some decision problems for polynomial mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248614)