![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Greco Gianluigi
Publisher: Springer Publishing Company
ISSN: 1383-7133
Source: Constraints, Vol.18, Iss.1, 2013-01, pp. : 38-74
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)
Counting the solutions of Presburger equations without enumerating them
Theoretical Computer Science, Vol. 313, Iss. 1, 2004-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Implementing a Test for Tractability
By Gault Richard Jeavons Peter
Constraints, Vol. 9, Iss. 2, 2004-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Theoretical Computer Science, Vol. 138, Iss. 2, 1995-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
CSP, partial automata, and coalgebras
By Wolter U.
Theoretical Computer Science, Vol. 280, Iss. 1, 2002-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Notes on the methodology of CCS and CSP
Theoretical Computer Science, Vol. 177, Iss. 2, 1997-05 ,pp. :