✦ LIBER ✦

Taylorian fields and subdivision algorithms

✍ Scribed by A. Méhauté

Book ID: 105474797
Publisher: Springer US
Year: 1991
Tongue: English
Weight: 386 KB
Volume: 1
Category: Article
ISSN: 1017-1398
DOI: 10.1007/bf02142324

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subdivision algorithms and the kernel of

Subdivision algorithms and the kernel of a polyhedron

✍ R. J. Gardner; M. Kallay 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 620 KB

The subdivision algorithm for generating

The subdivision algorithm for generating curves and its properties

✍ Wu Zongmin; Ye Qing; Liu Jianpin 📂 Article 📅 1994 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 306 KB

Solving two point boundary value problem

Solving two point boundary value problems by interpolatory subdivision algorithms

✍ Qu, Ruibin; Agarwal, Ravi P. 📂 Article 📅 1996 🏛 Taylor and Francis Group 🌐 English ⚖ 458 KB

Quantum algorithms for number fields

✍ D. Haase; H. Maier 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB

## Abstract This is a survey of recent results on quantum algorithms for the computation of invariants of number fields, namely the class number and the regulator. Most known classical algorithms for the computation of these values are of subexponential complexity and depend on the truth of a still

Probabilistic Algorithms in Finite Field

Probabilistic Algorithms in Finite Fields

✍ Rabin, Michael O. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 1017 KB

ICA over finite fields—Separability and

ICA over finite fields—Separability and algorithms

✍ Harold W. Gutch; Peter Gruber; Arie Yeredor; Fabian J. Theis 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 735 KB