✦ LIBER ✦

On the complexity of computing determinants

✍ Scribed by Erich Kaltofen; Gilles Villard

Publisher: Springer
Year: 2005
Tongue: English
Weight: 412 KB
Volume: 13
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-004-0185-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the computational complexity of deter

On the computational complexity of determining polyatomic structures by X-rays

✍ R.J. Gardner; P. Gritzmann; D. Prangenberg 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 297 KB

The problem of recovering the structure of crystalline materials from their discrete X-rays is of fundamental interest in many practical applications. An important special case concerns determining the position of atoms of several di erent types in the integer lattice, given the number of each type

On the Complexity of Computing Error Bou

On the Complexity of Computing Error Bounds

✍ J. Demmel; B. Diament; G. Malajovich 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 165 KB

The complexity of computing exponents

✍ S. S. Marchenkov 📂 Article 📅 1982 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 340 KB

On the Complexity of Approximating Extre

On the Complexity of Approximating Extremal Determinants in Matrices

✍ L. Khachiyan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 525 KB

On the complexity of computing the diame

On the complexity of computing the diameter of a polytope

✍ Alan M. Frieze; Shang-Hua Teng 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 585 KB

The complexity of computing the tutte po

The complexity of computing the tutte polynomial on transversal matroids

✍ Charles J. Colbourn; J. Scott Provan; Dirk Vertigan 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 478 KB