Skolem functions of arithmetical sentences.

DOI10.1016/S0890-5401(03)00085-3zbMath1047.03032MaRDI QIDQ1427862

D. Massart

Publication date: 14 March 2004

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

zbMATH Keywords

generalized Riemann hypothesisSkolem functionspolynomial time algorithmspolynomial boundsarithmetical formulas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational complexity of logical theories
• Computational complexity of arithmetical sentences
• The bounds of Skolem functions and their applications
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Computational complexities of diophantine equations with parameters
• The Distribution of Galois Groups and Hilbert's Irreducibility Theorem
• Reduction of an arbitrary diophantine equation to one in 13 unknowns
• Existence and feasibility in arithmetic