Author:
Kalimullin Iskander,Melnikov Alexander,Ng Keng Meng
Subject
General Computer Science,Theoretical Computer Science
Reference50 articles.
1. Existence and uniqueness of structures computable in polynomial time;Alaev;Algebra Logic,2016
2. Decidable models of ω-stable theories;Andrews;J. Symbolic Logic,2014
3. Computable Structures and the Hyperarithmetical Hierarchy;Ash,2000
4. Breaking up finite automata presentable torsion-free Abelian groups;Braun;Internat. J. Algebra Comput.,2011
5. Polynomial time versus computable Boolean algebras;Cenzer,1999
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献