Refined Bounds on the Number of Connected Components of Sign Conditions on a Variety

ISSN： 0179-5376

Source： Discrete & Computational Geometry, Vol.47, Iss.3, 2012-04, pp. : 577-597

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

Some Bounds for the Number of Blocks

By Noda R.

European Journal of Combinatorics, Vol. 22, Iss. 1, 2001-01 ,pp. : 91-94

Elsevier

Access to resources Recommend Favorite

Some Bounds for the Number of Blocks II

By Noda R.

European Journal of Combinatorics, Vol. 22, Iss. 1, 2001-01 ,pp. : 95-100

Elsevier

Access to resources Recommend Favorite

Refined class number formulas and Kolyvagin systems

Compositio Mathematica, Vol. 147, Iss. 1, 2011-01 ,pp. : 56-74

Cambridge University Press

Access to resources Recommend Favorite

Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter

By Jansen Bart

Theory of Computing Systems, Vol. 53, Iss. 2, 2013-08 ,pp. : 263-299

Springer Publishing Company

Access to resources Recommend Favorite

Some Refined Eigenvalue Perturbation Bounds for Two-by-Two Block Hermitian Matrices

East Asian Journal on Applied Mathematics, Vol. 5, Iss. 2, 2015-05 ,pp. : 126-137

Cambridge University Press

Access to resources Recommend Favorite