Space complexity of abelian groups

DOI10.1007/S00153-008-0113-3zbMATH Open1161.03021OpenAlexW1998346234MaRDI QIDQ1005925FDOQ1005925

Zia Uddin, Rodney G. Downey, Douglas Cenzer, Jeffrey 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

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

Cites Work

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

Cited In (13)

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

This page was built for publication: Space complexity of abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005925)