IDEAS home Printed from https://ideas.repec.org/a/aes/infoec/v13y2009i4p116-128.html
   My bibliography  Save this article

Comparing Two Multivariable Complexity Functions Using One-variable Complexity Classes

Author

Listed:
  • Andrei Horia MOGOS
  • Adina Magda FLOREA

Abstract

The comparison of algorithms complexities is very important both in theory and in practice. When we compare algorithms complexities we need to compare complexity functions. Usually we use one-variable complexity functions. Sometimes, we need multivariable complexity func-tions. In a previous paper we defined several one-variable complexity classes for multivariable complexity functions. Each complexity class of this type is a set of multivariable complexity functions, represented by a one-variable complexity function. In this paper we continue the work from that paper: we define new one-variable complexity classes and we prove several properties. The most important results are several criteria for two multivariable complexity functions to be comparable.

Suggested Citation

  • Andrei Horia MOGOS & Adina Magda FLOREA, 2009. "Comparing Two Multivariable Complexity Functions Using One-variable Complexity Classes," Informatica Economica, Academy of Economic Studies - Bucharest, Romania, vol. 13(4), pages 116-128.
    • Handle: RePEc:aes:infoec:v:13:y:2009:i:4:p:116-128
    as

    Download full text from publisher

    File URL: http://revistaie.ase.ro/content/52/12%20-%20Mogos,%20Florea.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Andrei-Horia MOGOS & Adina Magda FLOREA, 2009. "A Method To Compare Two Multivariable Complexity Functions," Proceedings of the 4th International Conference on Knowledge Management: Projects, Systems and Technologies,Bucharest, November 6-7 2009 12, Faculty of Economic Cybernetics, Statistics and Informatics, Academy of Economic Studies and National Defence University "Carol I", DEPARTMENT FOR MANAGEMENT OF THE DEFENCE RESOURCES AND EDUCATION.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:aes:infoec:v:13:y:2009:i:4:p:116-128. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Paul Pocatilu (email available below). General contact details of provider: https://edirc.repec.org/data/aseeero.html .

      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.