Abstract
In 1995, Schellekens introduced the complexity (quasi-metric) space as a part of the development of a topological foundation for the complexity analysis of algorithms. Recently, Romaguera and Schellekens have obtained several quasi-metric properties of the complexity space which are interesting from a computational point of view, via the analysis of the so-called dual complexity space. Here, we extend the notion of the dual complexity space to the p-dual case, with p > 1, in order to include some other kinds of exponential time algorithms in this study. We show that the dual p-complexity space is isometrically isomorphic to the positive cone of l p endowed with the asymmetric norm |.| + p given on l p by | x| + p = [∑ n=0 ∞(( x n V0) p )] 1/ p , where x ≔ ( x n ) nϵω . We also obtain some results on completeness and compactness of these spaces.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.