A Method To Compare Two Multivariable Complexity Functions
The comparison of algorithms complexities can be reduced to the comparison of complexity functions. In two previous papers, we obtained some results related to the comparison of one-variable complexity functions using complexity classes. In this paper, we extend some of these results to multivariable complexity functions.
|Date of creation:||Aug 2009|
|Date of revision:|
|Publication status:||Published in the Proceedings of the 4th International Conference on Knowledge Management: Projects, Systems and Technologies,Bu, November 6-7 2009, pages 61-65|
|Contact details of provider:|| Postal: 15-17 Dorobanti Road , Bucharest ,71131|
Phone: 004 021 2112650
Fax: 004 021 3112066
Web page: http://www.csie.ase.ro/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:rom:confkm:12. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mogos Radu)
If references are entirely missing, you can add them using this form.