Logspace complexity of functions and structures

Authors:
Douglas Cenzer;Zia Uddin
Affiliations:
Department of Mathematics, University of Florida, Gainesville, Florida;Department of Mathematics, Lock Haven University of Pennsylvania, Lock Haven, PA
Venue:
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Year:
2006

Citing 4
Cited 0

Log depth circuits for division and related problems

SIAM Journal on Computing
Complexity and categoricity

Information and Computation - Special issue: logic and computational complexity
Feasibly Categorial Models

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Formal languages and their relation to automata

Formal languages and their relation to automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logspace complexity of functions and structures is based on the notion of a Turing machine with input and output as in Papadmitriou [16]. For any k 1, we construct a logspace isomorphism between {0,1}* and {0,1,..., k}*. We improve results of Cenzer and Remmel [5] by characterizing the sets which are logspace isomorphic to {1}*. We generalize Proposition 8.2 of [16] by giving upper bounds on the space complexity of compositions and use this to obtain the complexity of isomorphic copies of structures with different universes. Finally, we construct logspace models with standard universe {0,1}* of various additive groups, including Z(p∞) and the rationals.