Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,361,933 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
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.
2018
2018
Quantum Econometrics: How to Explain Its Quantitative Successes and How the Resulting Formulas Are Related to Scale Invariance, Entropy, and Fuzziness
K. Autchariyapanitkul
,
O. Kosheleva
,
V. Kreinovich
,
S. Sriboonchitta
International Symposium on Integrated Uncertainty…
2018
Corpus ID: 3770560
Many aspects of human behavior seem to be well-described by formulas of quantum physics. In this paper, we explain this…
Expand
2016
2016
On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation
S. Ballet
,
Nicolas Baudru
,
A. Bonnecaze
,
Mila Tukumuli
2016
Corpus ID: 119297475
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity…
Expand
Review
2015
Review
2015
Towards Successful Software Process Improvement Initiatives: Experiences from the Battlefield
T. Conte
,
N. Oliveira
,
+4 authors
K. C. Weber
Americas Conference on Information Systems
2015
Corpus ID: 34362216
Required) Over the past years Brazil has done significant investments in software process improvement. Among them, the long term…
Expand
2011
2011
From Total Assignment Enumeration to Modern SAT Solver
N. Dershowitz
,
Alexander Nadel
arXiv.org
2011
Corpus ID: 17850360
A new framework for presenting and analyzing the functionality of a modern DLL-based SAT solver is proposed. Our approach…
Expand
2005
2005
Deontic logic for the specification of system availability
Julien Brunel
2005
Corpus ID: 15190750
We study the specification and the verification of availabili ty policies. We first introduce the availability concept, and then…
Expand
Review
2004
Review
2004
The Computational Complexity Column by Jacobo Torán
J. Torán
2004
Corpus ID: 18573667
Resolution is, due to its simplicity and its relation to several automated theorem proving algorithms, one of the best studied…
Expand
Review
2002
Review
2002
Formulas for Success? Some Options for Market Access Negotiations
J. François
2002
Corpus ID: 56028933
Most of the large tariff reductions achieved in multilateral trade negotiations have involved the use of tariff-cutting formulas…
Expand
1997
1997
Prototypes for definable subsets of algebraically closed valued fields
J. E. Holly
Journal of Symbolic Logic (JSL)
1997
Corpus ID: 30733765
Abstract Elimination of imaginaries for 1-variable definable equivalence relations is proved for a theory of algebraically closed…
Expand
1994
1994
Enriched Interval Bilattices and Partial Many-Valued Logics: an Approach to Deal with Graded Truth and Imprecision
F. Esteva
,
P. Garcia-Calvés
,
L. Godo
Int. J. Uncertain. Fuzziness Knowl. Based Syst.
1994
Corpus ID: 7542925
Within the many-valued approach for approximate reasoning, the aim of this paper is two-fold. First, to extend truth-values…
Expand
1994
1994
Feasibly Categorial Models
D. Cenzer
,
J. Remmel
Logical and Computational Complexity
1994
Corpus ID: 43827350
We define a notion of a Scott family of formulas for a feasible model and give various conditions on a Scott family which imply…
Expand
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)
ACCEPT & CONTINUE