Space complexity of abelian groups

DOI10.1007/s00153-008-0113-3zbMath1161.03021OpenAlexW1998346234MaRDI QIDQ1005925

Zia Uddin, Douglas Cenzer, Rodney G. Downey, Jeffery B. Remmel

Publication date: 17 March 2009

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-008-0113-3

zbMATH Keywords

computable model theoryeffective categoricitycomputable abelian groupsLOGSPACE presentationsLOGSPACE structures

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

Punctual copies of algebraic structures, Graphs are not universal for online computability, The diversity of categoricity without delay, A structure of punctual dimension two, Algebraic structures computable without delay, Eliminating unbounded search in computable algebra, The back-and-forth method and computability without delay, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, Non-density in punctual computability, FOUNDATIONS OF ONLINE STRUCTURE THEORY, Unnamed Item, PUNCTUAL CATEGORICITY AND UNIVERSALITY, Computable embeddability for algebraic structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity-theoretic algebra. II: Boolean algebras
• Effective categoricity of abelian \(p\)-groups
• Polynomial-time versus recursive models
• Polynomial-time Abelian groups
• Complexity and categoricity
• PRIMES is in P
• Effective categoricity of equivalence structures
• Division in logspace-uniformNC¹
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• Log Depth Circuits for Division and Related Problems
• Logical Approaches to Computational Barriers