Efficient proprietary certification process and secured theft-protected proprietary certificates.
Anitha, R., Sankarasubramanian, R.S. (2008)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Anitha, R., Sankarasubramanian, R.S. (2008)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Meer, Klaus, Michaux, Christian (1997)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
Ivan Kramosil (1990)
Kybernetika
Similarity:
Jacek Blazewicz, Marta Kasprzak (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In the paper, the problem of the genome mapping of DNA molecules, is presented. In particular, the new approach — the Simplified Partial Digest Problem (SPDP), is analyzed. This approach, although easy in laboratory implementation and robust with respect to measurement errors, when formulated in terms of a combinatorial search problem, is proved to be strongly NP-hard for the general error-free case. For a subproblem of the SPDP, a simple O()-time algorithm is given, where is a number...
Calude, Cristian S., Dinneen, Michael J., Shu, Chi-Kou (2002)
Experimental Mathematics
Similarity:
J. Rothe (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
J.K. Lenstra, A.H.G. Rinnooy (1981)
Qüestiió
Similarity:
This is a tutorial survey of recent results in the area of multiprocessor scheduling. Computational complexity theory provides the framework in which these results are presented. They involve on one hand the development of new polynomial optimization algorithms, and on the other hand the application of the concept of NP-hardness as well as the analysis of approximation algorithms.
Robertas Damaševičius, Vytautas Štuikys (2010)
Computer Science and Information Systems
Similarity:
Sharashidze, G. (2004)
Bulletin of TICMI
Similarity: