Author： Bergman C. Slutzki G.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.270, Iss.1, 2002-01, pp. : 591-608
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
Access to resources
Recommend
On the computational complexity of dynamic graph problems
Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. :
Congruences and ideals in pseudo effect algebras as total algebras
By Pulmannová Silvia Vinceková Elena
Soft Computing, Vol. 14, Iss. 11, 2010-09 ,pp. :
Complexity of some problems in positive and related calculi
By Maksimova L.
Theoretical Computer Science, Vol. 303, Iss. 1, 2003-06 ,pp. :