✦ LIBER ✦

An algorithm of polynomial order for computing the covering dimension of a finite space

✍ Scribed by Georgiou, D.N.; Megaritis, A.C.

Book ID: 121983202
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 318 KB
Volume: 231
Category: Article
ISSN: 0096-3003
DOI: 10.1016/j.amc.2013.12.185

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for computing the eigenstru

An algorithm for computing the eigenstructure of a regular matrix polynomial

✍ Wen-Wei Lin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 665 KB

An algorithm for constructing a variety

An algorithm for constructing a variety of arbitrary finite dimension

✍ D. M. Smirnov 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 421 KB

Box-covering algorithm for fractal dimen

Box-covering algorithm for fractal dimension of complex networks

✍ Schneider, Christian M.; Kesselring, Tobias A.; Andrade, José S.; Herrmann, Hans 📂 Article 📅 2012 🏛 The American Physical Society 🌐 English ⚖ 479 KB

A computing procedure for the small indu

A computing procedure for the small inductive dimension of a finite\(\mathrm{T}_0\)-space

✍ Georgiou, Dimitris N.; Megaritis, Athanasios C.; Moshokoa, Seithuti P. 📂 Article 📅 2014 🏛 Springer-Verlag 🌐 English ⚖ 254 KB

An asymptotically superior algorithm for

An asymptotically superior algorithm for computing the characteristic polynomial of a tridiagonal matrix

✍ Krishna, H. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 225 KB

A polynomial time algorithm to compute t

A polynomial time algorithm to compute the Abelian kernel of a finite monoid

✍ Manuel Delgado; Pierre-Cyrille Héam 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 170 KB