Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem

ISSN： 0179-5376

Source： Discrete & Computational Geometry, Vol.32, Iss.3, 2004-09, pp. : 317-338

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

Related content

Combinatorial constructions for the Zeckendorf sum of digits of polynomial values

By Stoll Thomas

The Ramanujan Journal, Vol. 32, Iss. 2, 2013-11 ,pp. : 227-243

Springer Publishing Company

Access to resources Recommend Favorite

New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem

By Chang Maw-Shang

Theory of Computing Systems, Vol. 47, Iss. 2, 2010-08 ,pp. : 342-367

Springer Publishing Company

Access to resources Recommend Favorite

An application of combinatorial techniques to a topological problem

Bulletin of the Australian Mathematical Society, Vol. 9, Iss. 3, 1973-12 ,pp. : 439-443

Cambridge University Press

Access to resources Recommend Favorite

A New Approach to Polynomial Identities

By Mostafa M.

The Ramanujan Journal, Vol. 8, Iss. 4, 2005-01 ,pp. : 423-457

Springer Publishing Company

Access to resources Recommend Favorite

A Combinatorial Analysis of Zero-Divisor Graphs on Certain Polynomial Rings

By Vietri Andrea

Communications in Algebra, Vol. 41, Iss. 6, 2013-05 ,pp. : 2040-2047

Taylor & Francis Ltd

Access to resources Recommend Favorite