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

Electronic Notes in Theoretical Computer Science

Volumn 74, Issue SUPPL., 2003, Pages 39-50

  Garcia Raffi L M ^a   Romaguera, S ^a   Sanchez Perez E A ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Asymmetric norms; BiBanach; Exponential time algorithm; Isometrically isomorphic; Semialgebra; sup P(n) complexity space

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; POLYNOMIALS; THEOREM PROVING; TOPOLOGY; FUNCTIONS; MATHEMATICAL MODELS; MODAL ANALYSIS; NUMBER THEORY;

ASYMMETRIC NORM; BIBANACH; EXPONENTIAL TIME ALGORITHM; ISOMETRICALLY ISOMORPHIC; SEMIALGEBRA; SUPP(N)-COMPLEXITY SPACE; EXPONENTIAL TIME ALGORITHMS; SUP P(N)-COMPLEXITY SPACE;

COMPUTER SCIENCE; ALGEBRA;

EID: 23844542544     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80764-3     Document Type: Conference Paper

References (17)

1. Emerson A.E., Jutla C.S. The complexity of tree automata and logic of programs. Siam J. Comput. 29:1999;132-158
2. Ferrer J., Gregori V., Alegre C. Quasi-uniform structures in linear lattices. Rocky Montain J. Math. 23:1993;877-884
3. Fletcher P., Lindgren W.F. Quas-Uniform Spaces. 1982;Marcel Dekker, New York
4. García-Raffi L.M., Romaguera S., Sánchez-Pérez E.A. Sequence spaces and asymmetric norms in the theory of computational complexity. Math. Comput. Model. 36:2002;1-11
5. Keimel K., Roth W. Ordered Cones and Approximation. 1992;springer-Verlag, Berlin, Heidelberg
6. Künzi H.P.A. Nonsymmetric distances and their associated topologies: About the origins of basic ideas in the area of assymmetric topology. Aull C.E., Lowen R. Handbook of the History of General Topology, vol. 3. 2001;853-968 Kluwer, dordrecht
7. Künzi H.P.A., Schellekens M.P. The Yoneda completion of a quasi-metric space. Theoretical Comput. Sci. 278:2002;159-194
8. S.G. Matthews, Partial metric topology, In: Proc. 8th Summer Conference on General Topology and Appl., Ann. New York Acad. Sce. 728 (1994), 183-197.
9. Reilly I.L., Subhramanyam P.V., Vamanamurthy M.K. Cauchy sequences in quasi-pseudo-metric spaces. Monatsh. Math. 93:1982;127-140
10. Romaguera S., Sanchis M. Semi-Lepschitz functions and best approximation in quasi-metric spaces. Monatsh. Math. 103:2000;292-301
11. Romaguera S., Schellekens M. On the structure of the dual complexity space: The general case. Extacta Math. 13:1998;249-253
12. Romaguera S., Scellekens M. Quasi-metric properties of complexity spaces. Topology Appl. 98:1999;311-322
13. Romagurera S., Schellekens M. Duality and quasi-normability for comlexity spaces. Appl. Gen. Topology. 3:2002;91-112
14. Schellekens M. The Smyth completion: acommon foundation for denonational semantics and complexity analysis. Proc. MFPS 11, Electronic Notes in Theoretical Computer Science. 1:1995;211-232
15. M. Schellekens, Complexity spaces revisitied. Extended abstract, In: Proc. 8th Prague Topological Symposium, Topology Atlas, 1996, 337-348.
16. Smyth M.B. Quasi-uniformities: Reconciling domains with metric spaces. Main M., et al. Proc. MFPS 3, Lecture Notes in Computer Science 298. 1988;236-253 Springer, Berlin
17. Smyth M.B. Totally bounded spaces and compact ordered spaces as domains of computation. Reed G.M., Roscoe A.W., Wachter R.F. Topology and Category Theory in Computer Science. 1991;207-229 Clarendon Press, Oxford