Author： Tsuiki H.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.294, Iss.1, 2003-02, pp. : 307-331
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
A domain-theoretic approach to computability on the real line
Theoretical Computer Science, Vol. 210, Iss. 1, 1999-01 ,pp. :
Access to resources
Recommend
Recursion theoretic characterizations of complexity classes of counting functions
Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. :
Composition sequences for functions over a finite domain
By Salomaa A.
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. :
Domain-independent queries on databases with external functions
By Suciu D.
Theoretical Computer Science, Vol. 190, Iss. 2, 1998-01 ,pp. :