Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting

ISSN： 1615-3375

Source： Foundations of Computational Mathematics, Vol.9, Iss.1, 2009-02, pp. : 105-132

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

Weighted Tensor Product Algorithms for Linear Multivariate Problems

By Wasilkowski G.W. Woźniakowski H.

Journal of Complexity, Vol. 15, Iss. 3, 1999-09 ,pp. : 402-447

Academic Press

Access to resources Recommend Favorite

Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)

By Chistov A.

Journal of Mathematical Sciences, Vol. 174, Iss. 1, 2011-04 ,pp. : 71-89

Springer Publishing Company

Access to resources Recommend Favorite

A polynomial-time algorithm for linear optimization based on a new simple kernel function

By Bai Y. Q. Roos C.

Optimization Methods and Software, Vol. 18, Iss. 6, 2003-12 ,pp. : 631-646

Taylor & Francis Ltd

Access to resources Recommend Favorite

A simple polynomial-time rescaling algorithm for solving linear programs

By Dunagan John

Mathematical Programming, Vol. 114, Iss. 1, 2008-07 ,pp. : 101-114

Springer Publishing Company

Access to resources Recommend Favorite

On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems

By Mikhailyuk V.

Cybernetics and Systems Analysis, Vol. 47, Iss. 3, 2011-05 ,pp. : 368-374

Springer Publishing Company

Access to resources Recommend Favorite