Complexity of structures

We consider notions and techniques needed for the development of the computable structure theory with bounded resourses. We are mainly interested in polynomial-time computable and primitive recursive structures. We analyze presentation complexity of some important concrete structures, in particular, number fields and finitely generated structures. We show that some problems in this area turns out to depend on complexity-theoretic conjectures like P=NP.