Constructibility of the Set of Polynomials with a Fixed Bernstein–Sato Polynomial: an Algorithmic Approach

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.32, Iss.6, 2001-12, pp. : 663-675

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

Algorithm for Computing Bernstein–Sato Ideals Associated with a Polynomial Mapping

By Bahloul R.

Journal of Symbolic Computation, Vol. 32, Iss. 6, 2001-12 ,pp. : 643-662

Academic Press

Access to resources Recommend Favorite

Formalization of Bernstein Polynomials and Applications to Global Optimization

By Muñoz César

Journal of Automated Reasoning, Vol. 51, Iss. 2, 2013-08 ,pp. : 151-196

Springer Publishing Company

Access to resources Recommend Favorite

Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm

By Nataraj P. Arounassalame M.

Journal of Global Optimization, Vol. 49, Iss. 2, 2011-02 ,pp. : 185-212

Springer Publishing Company

Access to resources Recommend Favorite

The optimal LLL algorithm is still polynomial in fixed dimension

By Akhavi A.

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 3-23

Elsevier

Access to resources Recommend Favorite

On the greatest fixed point of a set functor

By Adamek J. Koubek V.

Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. : 57-75

Elsevier

Access to resources Recommend Favorite