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: | Pasechnik, Dmitrii V. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
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 |
Similar Items
-
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
by: Klerk, Etienne de., et al.
Published: (2012) -
On the number of inductively minimal geometries
by: Cara, Philippe, et al.
Published: (2013) -
On NP-hardness of the clique partition : independence number gap recognition and related problems
by: Busygin, Stanislav., et al.
Published: (2012) -
Computing the nucleolus of weighted voting games
by: Pasechnik, Dmitrii V., et al.
Published: (2011) -
c-Extensions of the F4(2)-building
by: Ivanov, A. A., et al.
Published: (2012)