Structures Computable in Polynomial Time. I
Sign Up to like & getrecommendations! Published in 2017 at "Algebra and Logic"
DOI: 10.1007/s10469-017-9416-y
Abstract: It is proved that every computable locally finite structure with finitely many functions has a presentation computable in polynomial time. Furthermore, a structure computable in polynomial time is polynomially categorical iff it is finite. If… read more here.
Keywords: computable polynomial; structures computable; polynomial time; structure ... See more keywords