Roundings Respecting Hard Constraints

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.40, Iss.4, 2007-06, pp. : 467-483

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

Scoring with constraints

ANZIAM Journal, Vol. 42, Iss. 1, 2000-07 ,pp. : 9-25

Cambridge University Press

Access to resources Recommend Favorite

Andersen Filtration and Hard Lefschetz

By Soergel Wolfgang

Geometric & Functional Analysis GAFA, Vol. 17, Iss. 6, 2008-03 ,pp. : 2066-2089

Springer Publishing Company

Access to resources Recommend Favorite

The Complexity of Problems for Quantified Constraints

By Bauland Michael

Theory of Computing Systems, Vol. 47, Iss. 2, 2010-08 ,pp. : 454-490

Springer Publishing Company

Access to resources Recommend Favorite

On a Bernoulli problem with geometric constraints

By Laurain Antoine Privat Yannick

ESAIM: Control, Optimisation and Calculus of Variations, Vol. 18, Iss. 1, 2012-02 ,pp. : 157-180

Edp Sciences

Access to resources Recommend Favorite

Hard Lefschetz theorem for simple polytopes

By Fleming Balin Karu Kalle

Journal of Algebraic Combinatorics, Vol. 32, Iss. 2, 2010-09 ,pp. : 227-239

Springer Publishing Company

Access to resources Recommend Favorite