On the minimum number of negations leading to super-polynomial savings

Author： Jukna S.  

Publisher： Elsevier

ISSN： 0020-0190

Source： Information Processing Letters, Vol.89, Iss.2, 2004-01, pp. : 71-74

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

Estimations for the Separation Number of a Polynomial System

By dedieu J.P.  

Journal of Symbolic Computation, Vol. 24, Iss. 6, 1997-12 ,pp. : 683-693

Academic Press

Access to resources Recommend Favorite

Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares

By Nie Jiawang   Demmel James  

Journal of Global Optimization, Vol. 33, Iss. 4, 2005-12 ,pp. : 511-525

Springer Publishing Company

Access to resources Recommend Favorite

On the minimum number of processors for scheduling problems with communicationdelays

By Moukrim A.  

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 455-472

Springer Publishing Company

Access to resources Recommend Favorite

Generating a checking sequence with a minimum number of reset transitions

By Hierons R.  

Automated Software Engineering, Vol. 17, Iss. 3, 2010-09 ,pp. : 217-250

Springer Publishing Company

Access to resources Recommend Favorite

Permutation routing in optical MIN with minimum number of stages

By Das N.   Bhattacharya B.B.   Bezrukov S.L.  

Journal of Systems Architecture, Vol. 48, Iss. 11, 2003-04 ,pp. : 311-323

Elsevier

Access to resources Recommend Favorite