The bounds of Skolem functions and their applications

DOI10.1006/INCO.1995.1106zbMATH Open0846.11065OpenAlexW1990906550MaRDI QIDQ1898486FDOQ1898486

Authors: Yanyan Li 

Publication date: 29 October 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1106

Recommendations

• Skolem functions of arithmetical sentences.
• Computational complexities of diophantine equations with parameters
• On diophantine equations over the ring of all algebraic integers
• Sentences over integral domains and their computational complexities
• On the complexity of Diophantine geometry in low dimensions (extended abstract)

zbMATH Keywords

generalized Riemann hypothesisSkolem functionsHilbert's irreducibility theoremcomputational complexitieswinning strategies of diophantine games

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Game theory (91A99) Complexity of computation (including implicit computational complexity) (03D15) Diophantine equations (11D99) Decidability (number-theoretic aspects) (11U05)

Cited In (4)

• Skolem functions of arithmetical sentences.
• On Skolem's Exponential Functions Below 2 2 x
• Sentences over integral domains and their computational complexities
• Existence and approximation results for SKC mappings in Busemann spaces

This page was built for publication: The bounds of Skolem functions and their applications

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