Exact complexity bounds for ordinal addition

By Maurin F.  

Theoretical Computer Science, Vol. 165, Iss. 2, 1996-10 ,pp. : 247-273

Elsevier

Access to resources Recommend Favorite

Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials

By Akritas A.   Strzeboński A.   Vigklas P.  

Computing, Vol. 78, Iss. 4, 2006-12 ,pp. : 355-367

Springer Publishing Company

Access to resources Recommend Favorite

Proof Pearl: a Formal Proof of Higman's Lemma in ACL2

By Martín-Mateos Francisco  

Journal of Automated Reasoning, Vol. 47, Iss. 3, 2011-10 ,pp. : 229-250

Springer Publishing Company

Access to resources Recommend Favorite

The Representation of Quantitative and Ordinal Information

By Wang Zeshen   Ormeling Ferjan  

The Cartographic Journal, Vol. 33, Iss. 2, 1996-12 ,pp. : 87-91

Maney Publishing

Access to resources Recommend Favorite

Bounds and error bounds for queueing networks

By van Dijk N.M.  

Annals of Operations Research, Vol. 79, Iss. 1, 1998-01 ,pp. : 295-319

Springer Publishing Company

Access to resources Recommend Favorite