View in EDS

Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms

Saved in:
Bibliographic Details
Title: Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms
Authors: García-Raffi, L.M.1 lmgarcia@mat.upv.es, Romaguera, S.1 sromague@mat.upv.es, Schellekens, M.P.2 m.schellekens@cs.ucc.ie
Source: Journal of Mathematical Analysis & Applications. Dec2008, Vol. 348 Issue 1, p346-355. 10p.
Subjects: Algorithms, Algebra, Foundations of arithmetic, Computer programming
Abstract: Abstract: Schellekens [M. Schellekens, The Smyth completion: A common foundation for denotational semantics and complexity analysis, in: Proc. MFPS 11, in: Electron. Notes Theor. Comput. Sci., vol. 1, 1995, pp. 535–556], and Romaguera and Schellekens [S. Romaguera, M. Schellekens, Quasi-metric properties of complexity spaces, Topology Appl. 98 (1999) 311–322] introduced a topological foundation to obtain complexity results through the application of Semantic techniques to Divide and Conquer Algorithms. This involved the fact that the complexity (quasi-metric) space is Smyth complete and the use of a version of the Banach fixed point theorem and improver functionals. To further bridge the gap between Semantics and Complexity, we show here that these techniques of analysis, based on the theory of complexity spaces, extend to General Probabilistic Divide and Conquer schema discussed by Flajolet [P. Flajolet, Analytic analysis of algorithms, in: W. Kuich (Ed.), 19th Internat. Colloq. ICALP''92, Vienna, July 1992; Automata, Languages and Programming, in: Lecture Notes in Comput. Sci., vol. 623, 1992, pp. 186–210]. In particular, we obtain a general method which is useful to show that for several recurrence equations based on the recursive structure of General Probabilistic Divide and Conquer Algorithms, the associated functionals have a unique fixed point which is the solution for the corresponding recurrence equation. [Copyright &y& Elsevier]
Copyright of Journal of Mathematical Analysis & Applications is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 34082880
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22García-Raffi%2C+L%2EM%2E%22">García-Raffi, L.M.</searchLink><relatesTo>1</relatesTo><i> lmgarcia@mat.upv.es</i><br /><searchLink fieldCode="AR" term="%22Romaguera%2C+S%2E%22">Romaguera, S.</searchLink><relatesTo>1</relatesTo><i> sromague@mat.upv.es</i><br /><searchLink fieldCode="AR" term="%22Schellekens%2C+M%2EP%2E%22">Schellekens, M.P.</searchLink><relatesTo>2</relatesTo><i> m.schellekens@cs.ucc.ie</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Mathematical+Analysis+%26+Applications%22">Journal of Mathematical Analysis & Applications</searchLink>. Dec2008, Vol. 348 Issue 1, p346-355. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Algebra%22">Algebra</searchLink><br /><searchLink fieldCode="DE" term="%22Foundations+of+arithmetic%22">Foundations of arithmetic</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: Schellekens [M. Schellekens, The Smyth completion: A common foundation for denotational semantics and complexity analysis, in: Proc. MFPS 11, in: Electron. Notes Theor. Comput. Sci., vol. 1, 1995, pp. 535–556], and Romaguera and Schellekens [S. Romaguera, M. Schellekens, Quasi-metric properties of complexity spaces, Topology Appl. 98 (1999) 311–322] introduced a topological foundation to obtain complexity results through the application of Semantic techniques to Divide and Conquer Algorithms. This involved the fact that the complexity (quasi-metric) space is Smyth complete and the use of a version of the Banach fixed point theorem and improver functionals. To further bridge the gap between Semantics and Complexity, we show here that these techniques of analysis, based on the theory of complexity spaces, extend to General Probabilistic Divide and Conquer schema discussed by Flajolet [P. Flajolet, Analytic analysis of algorithms, in: W. Kuich (Ed.), 19th Internat. Colloq. ICALP''92, Vienna, July 1992; Automata, Languages and Programming, in: Lecture Notes in Comput. Sci., vol. 623, 1992, pp. 186–210]. In particular, we obtain a general method which is useful to show that for several recurrence equations based on the recursive structure of General Probabilistic Divide and Conquer Algorithms, the associated functionals have a unique fixed point which is the solution for the corresponding recurrence equation. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Mathematical Analysis & Applications is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=34082880
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.jmaa.2008.07.026
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 346
    Subjects:
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Algebra
        Type: general
      – SubjectFull: Foundations of arithmetic
        Type: general
      – SubjectFull: Computer programming
        Type: general
    Titles:
      – TitleFull: Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: García-Raffi, L.M.
      – PersonEntity:
          Name:
            NameFull: Romaguera, S.
      – PersonEntity:
          Name:
            NameFull: Schellekens, M.P.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 0022247X
          Numbering:
            – Type: volume
              Value: 348
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Journal of Mathematical Analysis & Applications
              Type: main
ResultId 1