scientific article; zbMATH DE number 1185840

MaRDI QIDQ3839484zbMATH OpenFDO

Authors Daniel Shanks

Publication date 9 August 1998

Mathematics Subject Classification ID

Problem books (00A07) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Elementary number theory (11Axx) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11Kxx)

Cited in

(19)

• Reading Gauss in the computer age: On the U.S. Reception of Gauss's number theoretical work (1938-1989)
• The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
• Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
• Prime simplicity
• Efficient representation in spaces of plane curves
• Some divisibility properties of binomial and \(q\)-binomial coefficients
• Some empirical observations on primitive roots
• Two contradictory conjectures concerning Carmichael numbers
• Average ranks of elliptic curves: Tension between data and conjecture
• Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
• Envelope computation in the plane by approximate implicitization
• The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard
• Distributions of Mersenne Divisors
• Unique representation of primitive factors of 2 n −1,n ODD, in certain quadratic forms
• Three New Mersenne Primes and a Statistical Theory
• Refining the hierarchies of classes of geometric intersection graphs
• Characterizations of pretzel knots which are simple-ribbon
• Enumeration of dicirculant digraphs
• Number-theoretic interpretation and construction of a digital circle

This page was built for publication:

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