✦ LIBER ✦

Computing border bases without using a term ordering

✍ Scribed by Stefan Kaspar

Book ID: 120722380
Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 226 KB
Volume: 54
Category: Article
ISSN: 0138-4821
DOI: 10.1007/s13366-011-0070-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing border bases using mutant stra

Computing border bases using mutant strategies

✍ Ullah, E.; Abbas Khan, S. 📂 Article 📅 2014 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 318 KB

Computing a perfect edge without vertex

Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph

✍ T. Kloks; D. Kratsch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 473 KB

A fast algorithm for computing multiplic

A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

✍ Toshiya Itoh; Shigeo Tsujii 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Nondestructive evaluation using a reduce

Nondestructive evaluation using a reduced-order computational methodology

✍ Banks, H T; Joyner, Michele L; Wincheski, Buzz; Winfree, William P 📂 Article 📅 2000 🏛 Institute of Physics 🌐 English ⚖ 141 KB

A Computer Algebra System based on Order

A Computer Algebra System based on Order-sorted Algebra

✍ Anthony C. Hearn; Eberhard Schrüfer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 447 KB

This paper presents the prototype design of an algebraic computation system that manipulates algebraic quantities as generic objects using order-sorted algebra as the underlying model. The resulting programs have a form that is closely related to the algorithmic description of a problem, but with th

Pass the Globe: Teaching Bootstrapping W

Pass the Globe: Teaching Bootstrapping Without Using a Computer

✍ A. Alexander Beaujean; Susan Cooper-Twamley 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 68 KB