𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Noncommutative minimization algorithms

✍ Scribed by M. Flouret; E. Laugerotte

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
317 KB
Volume
64
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

We give effective algorithms for the minimization of rational series over any field (commutative or not). Explicit constructions of minimization and intertwining of minimal models are given in full details. @

πŸ“œ SIMILAR VOLUMES

Low-complexity minimization algorithms
Low-complexity minimization algorithms
✍ Carmine Di Fiore; Stefano Fanelli; Paolo Zellini πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 139 KB
On Quantum Algorithms for Noncommutative
On Quantum Algorithms for Noncommutative Hidden Subgroups
✍ Mark Ettinger; Peter HΓΈyer πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 122 KB

Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden subgroups of noncommutative groups. We present a quantum a