Author： Handley W.G.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.172, Iss.1, 1997-02, pp. : 135-174
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 &unknown; 1 Procrustes problem
Future Generation Computer Systems, Vol. 19, Iss. 7, 2003-10 ,pp. :
Words whose complexity satisfies limp(n)n=1
By Aberkane A.
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :
SOME PROPERTIES OF THE 3 n 1 FUNCTION
Cybernetics and Systems, Vol. 27, Iss. 5, 1996-10 ,pp. :
Topological adjacency relations on Z n
By Kong T.Y.
Theoretical Computer Science, Vol. 283, Iss. 1, 2002-06 ,pp. :