Some decision problems for polynomial mappings

DOI10.1016/0304-3975(78)90010-5zbMATH Open0383.03012OpenAlexW2010338297MaRDI QIDQ1248614FDOQ1248614

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

• Title not available (Why is that?)
• The decision problem for exponential diophantine equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hilbert's Tenth Problem is Unsolvable
• Classes of Recursively Enumerable Sets and Their Decision Problems
• An unsolvable problem in number theory
• Preserving Proximity in Arrays
• Allocating Storage for Extendible Arrays
• Data graphs and addressing schemes
• Managing Storage for Extendible Arrays

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)