Author: Maňuch Ján
Publisher: Springer Publishing Company
ISSN: 1567-7818
Source: Natural Computing, Vol.10, Iss.1, 2011-03, pp. : 391-405
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Strong NP-completeness of a matrix similarity problem
By Brimkov V. Codenotti B. Leoncini M. Resta G.
Theoretical Computer Science, Vol. 165, Iss. 2, 1996-10 ,pp. :
Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. :
NP-completeness for calculating power indices of weighted majority games
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :