✦ LIBER ✦

An algorithmic approach to discovering and provingq-series identities

✍ Scribed by G. E. Andrews; A. Knopfmacher

Book ID: 110621250
Publisher: Springer
Year: 2001
Tongue: English
Weight: 320 KB
Volume: 29
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf02679612

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithmic approach to combining bel

An algorithmic approach to combining belief functions

✍ Bruce E. Tonn 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 913 KB

Methods of combination are used to synthesize pieces of evidence of equal standing that represent different aspects of a specific system about which a diagnosis is to be made. Combination is distinct from consensus, when complete diagnoses rendered by different knowledge sources require synthesis, a

An algorithmic approach to esthetic faci

An algorithmic approach to esthetic facial volume restoration

✍ David J. Kouba; Edgar F. Fincher; Ronald L. Moy 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 39 KB

An algorithmic and information-theoretic

An algorithmic and information-theoretic approach to multimetric index construction

✍ Donald R. Schoolmaster Jr.; James B. Grace; E. William Schweiger; Glenn R. Gunte 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 961 KB

To cut or to daub? An algorithmic approa

To cut or to daub? An algorithmic approach to anal fissure

✍ Ian Lindsey 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 28 KB

AN APPROACH TO TIME SERIES SMOOTHING AND

AN APPROACH TO TIME SERIES SMOOTHING AND FORECASTING USING THE EM ALGORITHM

✍ R. H. Shumway; D. S. Stoffer 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 611 KB

An Algorithmic Approach to Fundamental G

An Algorithmic Approach to Fundamental Groups and Covers of Combinatorial Cell Complexes

✍ Sarah Rees; Leonard H. Soicher 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 341 KB

We first develop a construction, originally due to Reidemeister, of the fundamental group and covers of a two-dimensional combinatorial cell complex. Then, we describe a practical algorithmic approach to the computation of fundamental groups and first homology groups (as finitely presented groups),