Some decision problems for polynomial mappings
From MaRDI portal
Publication:1248614
DOI10.1016/0304-3975(78)90010-5zbMath0383.03012MaRDI QIDQ1248614
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
11U05: Decidability (number-theoretic aspects)
03B25: Decidability of theories and sets of sentences
11D41: Higher degree equations; Fermat's equation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The decision problem for exponential diophantine equations
- Data graphs and addressing schemes
- An unsolvable problem in number theory
- Allocating Storage for Extendible Arrays
- Preserving Proximity in Arrays
- Managing Storage for Extendible Arrays
- Hilbert's Tenth Problem is Unsolvable
- Classes of Recursively Enumerable Sets and Their Decision Problems