✦ LIBER ✦

Algorithmic Enumeration of Ideal Classes for Quaternion Orders

✍ Scribed by Kirschmer, Markus; Voight, John

Book ID: 118181064
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 410 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/080734467

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Corrigendum: Algorithmic Enumeration of

Corrigendum: Algorithmic Enumeration of Ideal Classes for Quaternion Orders

✍ Kirschmer, Markus; Voight, John 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 70 KB

Generation and Enumeration of Some Class

Generation and Enumeration of Some Classes of Interval Orders

✍ F. Disanto, E. Pergola, R. Pinzani, S. Rinaldi 📂 Article 📅 2012 🏛 Springer Netherlands 🌐 English ⚖ 452 KB

A class of quaternion valued affine proj

A class of quaternion valued affine projection algorithms

✍ Jahanchahi, Cyrus; Cheong Took, Clive; Mandic, Danilo P. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 700 KB

Enumeration of Mapping Classes for the T

Enumeration of Mapping Classes for the Torus

✍ M. Takasawa 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 98 KB

A polynomial algorithm for recognizing t

A polynomial algorithm for recognizing the -order class

✍ Aziz Moukrim; Eric Sanlaville 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 474 KB

Transitive closure for restricted classe

Transitive closure for restricted classes of partial orders

✍ Tze-Heng Ma; Jeremy Spinrad 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 542 KB

Most papers dealing with partial orders assume that the input is given either in transitively closed or transitrvely reduced form. In this paper, we show that it is possible to solve some problems on partial orders in less time than it takes to perform transitive closure or reduction for general gra