Related content

Is the Euclidean Algorithm Optimal Among its Peers?

By  

Bulletin of Symbolic Logic, Vol. 10, Iss. 3, 2004-09 ,pp. : 390-418

Cambridge University Press

Access to resources Recommend Favorite

Logic made Easy: How to Know when Language Deceives You

By  

Bulletin of Symbolic Logic, Vol. 10, Iss. 4, 2004-12 ,pp. : 577-578

Cambridge University Press

Access to resources Recommend Favorite

Proving a group trivial made easy: A case study in coset enumeration

By  

Bulletin of the Australian Mathematical Society, Vol. 62, Iss. 1, 2000-08 ,pp. : 105-118

Cambridge University Press

Access to resources Recommend Favorite

An Efficient Algorithm to Construct an Orthonormal Basis for the Extended Krylov Subspace

By  

East Asian Journal on Applied Mathematics, Vol. 4, Iss. 3, 2014-08 ,pp. : 267-282

Cambridge University Press

Access to resources Recommend Favorite

Euclidean position in Euclidean 2-orbifolds

By Cortes C.   Marquez A.   Valenzuela J.  

Computational Geometry, Vol. 27, Iss. 1, 2004-01 ,pp. : 27-41

Elsevier

Access to resources Recommend Favorite