On computing Hilbert bases via the Elliot–MacMahon algorithm
The ways of using the Elliot–MacMahon algorithm to compute the Hilbert base of a system of linear Diophantine equations known so far are either not efficient or can fail to terminate. We present a version of an algorithm exploiting this range of ideas, which however is reasonably efficient as well a...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/95690 http://hdl.handle.net/10220/8240 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| id |
sg-ntu-dr.10356-95690 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-956902023-02-28T19:39:33Z On computing Hilbert bases via the Elliot–MacMahon algorithm Pasechnik, Dmitrii V. School of Physical and Mathematical Sciences DRNTU::Engineering::Computer science and engineering::Mathematics of computing The ways of using the Elliot–MacMahon algorithm to compute the Hilbert base of a system of linear Diophantine equations known so far are either not efficient or can fail to terminate. We present a version of an algorithm exploiting this range of ideas, which however is reasonably efficient as well as finite. Accepted version 2012-06-25T04:32:31Z 2019-12-06T19:19:55Z 2012-06-25T04:32:31Z 2019-12-06T19:19:55Z 2001 2001 Journal Article Pasechnik, D. V. (2001). On computing Hilbert bases via the Elliot–MacMahon algorithm. Theoretical Computing Science, 263(1-2), 37-46. https://hdl.handle.net/10356/95690 http://hdl.handle.net/10220/8240 10.1016/S0304-3975(00)00229-2 en Theoretical computer science © 2001 Elsevier. This is the author created version of a work that has been peer reviewed and accepted for publication by Theoretical Computer Science, Elsevier. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1016/S0304-3975(00)00229-2]. 12 p. application/pdf |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
NTU Library |
| collection |
DR-NTU |
| language |
English |
| topic |
DRNTU::Engineering::Computer science and engineering::Mathematics of computing |
| spellingShingle |
DRNTU::Engineering::Computer science and engineering::Mathematics of computing Pasechnik, Dmitrii V. On computing Hilbert bases via the Elliot–MacMahon algorithm |
| description |
The ways of using the Elliot–MacMahon algorithm to compute the Hilbert base of a system of linear Diophantine equations known so far are either not efficient or can fail to terminate. We present a version of an algorithm exploiting this range of ideas, which however is reasonably efficient as well as finite. |
| author2 |
School of Physical and Mathematical Sciences |
| author_facet |
School of Physical and Mathematical Sciences Pasechnik, Dmitrii V. |
| format |
Article |
| author |
Pasechnik, Dmitrii V. |
| author_sort |
Pasechnik, Dmitrii V. |
| title |
On computing Hilbert bases via the Elliot–MacMahon algorithm |
| title_short |
On computing Hilbert bases via the Elliot–MacMahon algorithm |
| title_full |
On computing Hilbert bases via the Elliot–MacMahon algorithm |
| title_fullStr |
On computing Hilbert bases via the Elliot–MacMahon algorithm |
| title_full_unstemmed |
On computing Hilbert bases via the Elliot–MacMahon algorithm |
| title_sort |
on computing hilbert bases via the elliot–macmahon algorithm |
| publishDate |
2012 |
| url |
https://hdl.handle.net/10356/95690 http://hdl.handle.net/10220/8240 |
| _version_ |
1759853891119218688 |