![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Cichon E.A. Bittar E.T.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.201, Iss.1, 1998-07, pp. : 63-84
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)
Exact complexity bounds for ordinal addition
By Maurin F.
Theoretical Computer Science, Vol. 165, Iss. 2, 1996-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The Representation of Quantitative and Ordinal Information
By Wang Zeshen Ormeling Ferjan
The Cartographic Journal, Vol. 33, Iss. 2, 1996-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Bounds and error bounds for queueing networks
Annals of Operations Research, Vol. 79, Iss. 1, 1998-01 ,pp. :