The bounds of Skolem functions and their applications

DOI10.1006/INCO.1995.1106zbMath0846.11065OpenAlexW1990906550MaRDI QIDQ1898486

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

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) Decidability (number-theoretic aspects) (11U05) Complexity of computation (including implicit computational complexity) (03D15) Diophantine equations (11D99)

Related Items (2)

Skolem functions of arithmetical sentences. ⋮ Sentences over integral domains and their computational complexities

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