IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/912962.html
   My bibliography  Save this article

A New Asymptotic Notation: Weak Theta

Author

Listed:
  • Andrei-Horia Mogoş
  • Bianca Mogoş
  • Adina Magda Florea

Abstract

Algorithms represent one of the fundamental issues in computer science, while asymptotic notations are widely accepted as the main tool for estimating the complexity of algorithms. Over the years a certain number of asymptotic notations have been proposed. Each of these notations is based on the comparison of various complexity functions with a given complexity function. In this paper, we define a new asymptotic notation, called “Weak Theta,” that uses the comparison of various complexity functions with two given complexity functions. Weak Theta notation is especially useful in characterizing complexity functions whose behaviour is hard to be approximated using a single complexity function. In addition, in order to highlight the main particularities of Weak Theta, we propose and prove several theoretical results: properties of Weak Theta, criteria for comparing two complexity functions, and properties of a new set of complexity functions (also defined in the paper) based on Weak Theta. Furthermore, to illustrate the usefulness of our notation, we discuss an application of Weak Theta in artificial intelligence.

Suggested Citation

  • Andrei-Horia Mogoş & Bianca Mogoş & Adina Magda Florea, 2015. "A New Asymptotic Notation: Weak Theta," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-15, October.
    • Handle: RePEc:hin:jnlmpe:912962
    DOI: 10.1155/2015/912962
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/912962.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2015/912962.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/912962?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:912962. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.