Author： Shul'gina O. N.
Publisher： MAIK Nauka/Interperiodica
ISSN： 0005-1179
Source： Automation and Remote Control, Vol.65, Iss.3, 2004-03, pp. : 456-463
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
The word problem for 1LC congruences is NP-hard
By Rosaz L.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
Access to resources
Recommend
Alignment and Distribution Is Not (Always) NP-Hard
By Boudet V. Rastello F. Robert Y.
Journal of Parallel and Distributed Computing, Vol. 61, Iss. 4, 2001-04 ,pp. :
Faster exact solutions for some NP-hard problems
Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. :
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. :