COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY

By  

The Journal of Symbolic Logic, Vol. 79, Iss. 3, 2014-08 ,pp. : 859-881

Cambridge University Press

Access to resources Recommend Favorite

Chaotic Root-finding for a Small Class of Polynomials

By Max Little   Daniel Heesch  

Journal of Difference Equations and Applications, Vol. 10, Iss. 11, 2004-09 ,pp. : 949-953

Taylor & Francis Ltd

Access to resources Recommend Favorite

The Problem of the Classification of the Nilpotent Class 2 Torsion Free Groups up to Geometric Equivalence

By Tsurkov A.  

Communications in Algebra, Vol. 36, Iss. 8, 2008-08 ,pp. : 3147-3154

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the equivalence of a countable disjoint class of sets of positive measure and a weaker condition than total σ–finiteness of measures

By  

Bulletin of the Australian Mathematical Society, Vol. 1, Iss. 2, 1969-08 ,pp. : 237-243

Cambridge University Press

Access to resources Recommend Favorite

Frobenius's Degree Formula and Toda's Polynomials

By Cai J.-Y.  

Theory of Computing Systems, Vol. 31, Iss. 1, 1998-02 ,pp. : 67-75

Springer Publishing Company

Access to resources Recommend Favorite