![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Schost E.
Publisher: Elsevier
ISSN: 0747-7171
Source: Journal of Symbolic Computation, Vol.36, Iss.3, 2003-09, pp. : 555-594
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)
On the Theories of Triangular Sets
By Aubry P. Lazard D. Maza M.M.
Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Query complexity of membership comparable sets
By Tantau T.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)