Effective presentations of structures

We consider some questions related to the search for efficient presentations for abstract mathematical structures. We formulate a general criterion that indicates when a given structure has an isomorphic presentation computable in polynomial time. As an example, we show how this theorem works in the class of unars. Some similar problems related to other complexity classes and algebraic fields are also considered.