![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Tantau T.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.302, Iss.1, 2003-06, pp. : 467-474
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Complexity results for triangular sets
By Schost E.
Journal of Symbolic Computation, Vol. 36, Iss. 3, 2003-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Semantic Representations and Query Languages for Or-Sets
Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The complexity of query evaluation in indefinite temporal constraint databases
Theoretical Computer Science, Vol. 171, Iss. 1, 1997-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Index sets and presentations of complexity classes
By Regan K.W.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :