Methods for justifying arithmetic hypotheses and computer algebra

DOI10.1134/S0361768806030029MaRDI QIDQ2433009zbMATH OpenOpenAlexWikidataFDO

Authors Nikolaj M. Glazunov

Publication date 26 October 2006

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0361768806030029

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Computational experiments in arithmetic geometry over finite fields and their computer support
• scientific article; zbMATH DE number 1944660
• Publication:4726316
• Formalized proof, computation, and the construction problem in algebraic geometry
• Development of computer-assisted algebraic research

Cites work

• Gauss Sums, Kloosterman Sums, and Monodromy Groups. (AM-116)
• How the Number of Points of An Elliptic Curve Over a Fixed Prime Field Varies
• scientific article; zbMATH DE number 41710 (Why is no real title available?)
• scientific article; zbMATH DE number 706265 (Why is no real title available?)
• scientific article; zbMATH DE number 1179513 (Why is no real title available?)
• scientific article; zbMATH DE number 3893286 (Why is no real title available?)
• Legendre sums, Soto-Andrade sums and Kloosterman sums.
• Nondifferentiable optimization and polynomial problems
• On an analogue of the Sato conjecture
• On the distribution of angles of Kloosterman sums.

Cited in

(3)

• Analytic solutions to heat transfer problems on a basis of determination of a front of heat disturbance
• Finite integer computations: An algebraic foundation for their correctness
• Terme, Gleichungen, Ungleichungen

This page was built for publication: Methods for justifying arithmetic hypotheses and computer algebra

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