The supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances

Abstract

Recently, E.A. Emerson and C.S. Jutla (SIAM J. Comput., 1999), have successfully applied complexity of tree automata to obtain optimal deterministic exponential time algorithms for some important modal logics of programs. The running time of these algorithms corresponds, of course, to complexity functions which are potential functions and, thus, they do not belong, in general, to any dual p-complexity space. Motivated by these facts we here introduce and study a very general class of complexity spaces, which provides, in the dual context, a suitable framework to carry out a description of the complexity functions that generate exponential time algorithms. In particular, such spaces can be modelled as biBanach semialgebras which are isometrically isomorphic to the positive cone of the asymmetric normed linear space consisting of bounded sequences of real numbers endowed with the supremum asymmetric norm.

DOI: 10.1016/S1571-0661(04)80764-3

Extracted Key Phrases

Cite this paper

@article{Raffi2002TheSA, title={The supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances}, author={L. M. Garc{\'i}a Raffi and Salvador Romaguera and Enrique Alfonso S{\'a}nchez-P{\'e}rez}, journal={Electr. Notes Theor. Comput. Sci.}, year={2002}, volume={74}, pages={39-50} }