Author： Boyar J. Peralta R. Pochuev D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.235, Iss.1, 2000-03, pp. : 43-57
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
&unknown;&unknown; 5 -equational theory of context unification is undecidable
By Vorobyov S.
Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. :
Access to resources
Recommend
On a complexity of the formula (A &unknown; B) &unknown; C
Theoretical Computer Science, Vol. 207, Iss. 2, 1998-11 ,pp. :
On the &unknown; 1 Procrustes problem
Future Generation Computer Systems, Vol. 19, Iss. 7, 2003-10 ,pp. :
The equation A&unknown;x=B&unknown;y over (max,+)
By Cuninghame-Green R.A. Butkovic P.
Theoretical Computer Science, Vol. 293, Iss. 1, 2003-02 ,pp. :