Author： Mityagin A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.310, Iss.1, 2004-01, pp. : 355-363
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
Access to resources
Recommend
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. :
Computational complexity of functions
By Levin L.A.
Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. :
The complexity of functions on lattices
By Sander
Theoretical Computer Science, Vol. 246, Iss. 1, 2000-09 ,pp. :
Algebraic decomposition of discrete functions
Automation and Remote Control, Vol. 67, Iss. 3, 2006-03 ,pp. :