A Polynomial-Time Dependence Test for Determining Integer-Valued Solutions in Multi-Dimensional Arrays Under Variable Bounds

Author： Chang Weng-Long Chu Chih-Ping Wu Jia-Hwa

Publisher： Springer Publishing Company

ISSN： 0920-8542

Source： The Journal of Supercomputing, Vol.31, Iss.2, 2005-02, pp. : 111-135

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

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference

By Fleischner H. Kullmann O. Szeider S.

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 503-516

Elsevier

Access to resources Recommend Favorite

On polynomial-time approximation algorithms for the variable length scheduling problem

By Czumaj A. Gasieniec L. Gaur D.R. Krishnamurti R. Rytter W. Zito M.

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 489-495

Elsevier

Access to resources Recommend Favorite

An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences

By Simanchev R. Urazova I.

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2102-2108

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Generalizations of suffix arrays to multi-dimensional matrices

By Kim D.K. Kim Y.A. Park K.

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 401-416

Elsevier

Access to resources Recommend Favorite

Generalizations of suffix arrays to multi-dimensional matrices

By Kim D.K. Kim Y.A. Park K.

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 223-238

Elsevier

Access to resources Recommend Favorite