Space complexity of Abelian groups
Authors:
- 12 December 2008
- journal article
- research article
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 48 (1) , 115-140
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Effective categoricity of equivalence structuresAnnals of Pure and Applied Logic, 2006
- PRIMES is in PAnnals of Mathematics, 2004
- Division in logspace-uniformNC1RAIRO - Theoretical Informatics and Applications, 2001
- Complexity and CategoricityInformation and Computation, 1998
- Polynomial-time abelian groupsAnnals of Pure and Applied Logic, 1992
- Polynomial-time versus recursive modelsAnnals of Pure and Applied Logic, 1991
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))The Journal of Symbolic Logic, 1990
- Complexity-theoretic algebra II: Boolean algebrasAnnals of Pure and Applied Logic, 1989
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986