Counting and enumeration complexity with application to multicriteria scheduling

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.153, Iss.1, 2007-09, pp. : 215-234

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

On the Complexity of Adjacent Resource Scheduling

By Duin C. Sluis E.

Journal of Scheduling, Vol. 9, Iss. 1, 2006-02 ,pp. : 49-62

Springer Publishing Company

Access to resources Recommend Favorite

The counting complexity of group-definable languages

By Arvind V. Vinodchandran N.V.

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 199-218

Elsevier

Access to resources Recommend Favorite

Multicriteria, multi-user scheduling in grids with advance reservation

By Kurowski Krzysztof Oleksiak Ariel Weglarz Jan

Journal of Scheduling, Vol. 13, Iss. 5, 2010-10 ,pp. : 493-508

Springer Publishing Company

Access to resources Recommend Favorite

On computational complexity of graph inference from counting

By Fazekas Szilárd Ito Hiro Okuno Yasushi Seki Shinnosuke Taneishi Kei

Natural Computing, Vol. 12, Iss. 4, 2013-12 ,pp. : 589-603

Springer Publishing Company

Access to resources Recommend Favorite

Recursion theoretic characterizations of complexity classes of counting functions

By Vollmer H. Wagner K.W.

Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. : 245-258

Elsevier

Access to resources Recommend Favorite