On the complexity of recognizing the Hilbert basis of a linear diophantine system

Author： Durand A.   Hermann M.   Juban L.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.270, Iss.1, 2002-01, pp. : 625-642

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Reduced complexity Volterra model of non-linear MISO system

By Mbarek Abdelkader   Garna Tarek   Bouzrara Kais   Messaoud Hassani  

International Journal of Modelling, Identification and Control, Vol. 16, Iss. 2, 2012-05 ,pp. : 134-148

Inderscience Publishers

Access to resources Recommend Favorite

Avoiding slack variables in the solving of linear diophantine equations and inequations

By Ajili F.   Contejean E.  

Theoretical Computer Science, Vol. 173, Iss. 1, 1997-02 ,pp. : 183-208

Elsevier

Access to resources Recommend Favorite

A descriptive complexity approach to the linear hierarchy

By Hachaichi Y.  

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 421-429

Elsevier

Access to resources Recommend Favorite

Optimization complexity of linear logic proof games

By Lincoln P.D.   Mitchell J.C.   Scedrov A.  

Theoretical Computer Science, Vol. 227, Iss. 1, 1999-09 ,pp. : 299-331

Elsevier

Access to resources Recommend Favorite

The Computational Complexity of Some Problems of Linear Algebra

By Buss J.F.   Frandsen G.S.   Shallit J.O.  

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 572-596

Academic Press

Access to resources Recommend Favorite