Author： Nestmann U.
Publisher： Elsevier
ISSN： 1571-0661
Source： Electronic Notes in Theoretical Computer Science, Vol.16, Iss.2, 2004-01, pp. : 1-8
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Previous Menu Next
Abstract
Related content
On the expressive power of counting
Theoretical Computer Science, Vol. 149, Iss. 1, 1995-09 ,pp. :
Access to resources
Recommend
By Libkin L.
Theoretical Computer Science, Vol. 296, Iss. 3, 2003-03 ,pp. :
Circumscribing datalog: expressive power and complexity
Theoretical Computer Science, Vol. 193, Iss. 1, 1998-02 ,pp. :
On the expressive power of first-order boolean functions in PCF
By Pucella
Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. :
The Kolmogorov expressive power of Boolean query languages
Theoretical Computer Science, Vol. 190, Iss. 2, 1998-01 ,pp. :