Formal proofs of degree 5 binary BBP-type formulas (Q1948707): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the rapid computation of various polylogarithmic constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Random Character of Fundamental Constant Expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and Excluding <i>b</i>-ary Machin-Type Individual Digit Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of PSLQ, an integer relation finding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Non-PSLQ route to BBP-type formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3114290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel approach to the discovery of ternary BBP-type formulas for polylogarithm constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: New binary and ternary digit extraction (BBP-type) formulas for trilogarithm constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Novel Approach to the Discovery of Binary BBP-Type Formulas for Polylogarithm Constants / rank
 
Normal rank

Latest revision as of 09:09, 6 July 2024

scientific article
Language Label Description Also known as
English
Formal proofs of degree 5 binary BBP-type formulas
scientific article

    Statements

    Identifiers