Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance

By Zhang Binwu   Zhang Jianzhong   He Yong  

Journal of Global Optimization, Vol. 34, Iss. 3, 2006-03 ,pp. : 467-474

Springer Publishing Company

Access to resources Recommend Favorite

On the Hamming distance of constraint satisfaction problems

By Crescenzi P.   Rossi G.  

Theoretical Computer Science, Vol. 288, Iss. 1, 2002-10 ,pp. : 85-100

Elsevier

Access to resources Recommend Favorite

Approximate maxima finding of continuous functions under restricted budget

By Kranakis E.   Krizanc D.   Pelc A.   Peleg D.  

Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. : 151-162

Elsevier

Access to resources Recommend Favorite

On the complexity of finding common approximate substrings

By Evans P.A.   Smith A.D.   Wareham H.T.  

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 407-430

Elsevier

Access to resources Recommend Favorite

Secure computation of functionalities based on Hamming distance and its application to computing document similarity

By Jarrous Ayman  

International Journal of Applied Cryptography, Vol. 3, Iss. 1, 2013-04 ,pp. : 21-46

Inderscience Publishers

Access to resources Recommend Favorite