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

ISSN： 1072-3374

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

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 Computation of the Degree of a Dominant Morphism in Characteristic Zero. I

By Chistov A.

Journal of Mathematical Sciences, Vol. 131, Iss. 2, 2005-11 ,pp. : 5547-5568

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-time computation of the degree of a dominant morphism in zero characteristic. II

By Chistov A.

Journal of Mathematical Sciences, Vol. 138, Iss. 3, 2006-10 ,pp. : 5733-5752

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

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

By Wasilkowski G. Woźniakowski H.

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

Springer Publishing Company

Access to resources Recommend Favorite

Zero-cycles and cohomology on real algebraic varieties

By Colliot-Thelene J.-L. Scheiderer C.

Topology, Vol. 35, Iss. 2, 1996-04 ,pp. : 533-559

Elsevier

Access to resources Recommend Favorite