Skip to search formSkip to main contentSkip to account menu

Chudnovsky algorithm

Known as: Chudnovsky method, The Chudnovsky algorithm 
The Chudnovsky algorithm is a fast method for calculating the digits of π. It was published by the Chudnovsky brothers in 1989, and was used in the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Chronology of computation of πList of formulae involving πList of numerical analysis topics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Simulation of Harmonically Excited Simple Linear Pendulum (HESLP) Model using Selected Versions of Fourth Order Runge- Kutta Schemes
Classical pendulum is a very interesting dynamical system to study; it has been used to introduce the study of dynamic systems… 
2016
2016
On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity… 
2016
2016
The Determinants over Associative Rings: a Definition, Properties, New Formulas and a Computational Complexity
Recently the author in [1,2] has found a new family of formulas with free variables (polynomial identities) for the determinant… 
2013
2013
Rainbow supercharacters and a poset analogue to q -binomial coefficients
. This paper introduces a variation on the binomial coefficient that depends on a poset and interpolates between q -binomials and… 
2008
2008
From Backtracking to Chaff
Modern Chaff-like SAT solvers enhance plain backtracking (DLL) by Conflict-Driven Learning (CDL), including 1UIP-based Conflict… 
2005
2005
Deontic logic for the specification of system availability
We study the specification and the verification of availabili ty policies. We first introduce the availability concept, and then… 
Review
2004
Review
2004
The Computational Complexity Column by Jacobo Torán
Resolution is, due to its simplicity and its relation to several automated theorem proving algorithms, one of the best studied… 
1995
1995
Connection between Diierent Function Theories in Cliiord Analysis
We describe an explicit connection between solutions to equations Df = 0 (the Generalized Cauchy-Riemann equation) and (D+M)f = 0… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)