✦ LIBER ✦

Efficient computation of maximal orders in Artin–Schreier extensions

✍ Scribed by Sutherland, Nicole

Book ID: 120448772
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 250 KB
Volume: 53
Category: Article
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2012.11.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient computation of maximal orders

Efficient computation of maximal orders in radical (including Kummer) extensions

✍ Nicole Sutherland 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Arithmetic in generalized Artin-Schreier

Arithmetic in generalized Artin-Schreier extensions of k(x)

✍ Daniel J. Madden 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 919 KB

Efficient computation of order and mode

Efficient computation of order and mode of corner singularities in 3D-elasticity

✍ A. Dimitrov; H. Andrä; E. Schnack 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 537 KB

An efficient parallel algorithm for comp

An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3

✍ Elias Dahlhaus; Marek Karpinski; Pierre Kelsen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 375 KB

[Lecture Notes in Computer Science] Data

[Lecture Notes in Computer Science] Data Warehousing and Knowledge Discovery Volume 4081 || Efficient Mining of Large Maximal Bicliques

✍ Tjoa, A Min; Trujillo, Juan 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 421 KB

This Book Constitutes The Refereed Proceedings Of The 8th International Conference On Data Warehousing And Knowledge Discovery, Dawak 2006, Held In Conjunction With Dexa 2006. The Book Presents 53 Revised Full Papers, Organized In Topical Sections On Etl Processing, Materialized View, Multidimension

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automated Reasoning Volume 3097 || Efficient Checking of Term Ordering Constraints

✍ Basin, David; Rusinowitch, Michaël 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 247 KB