Linear recurrence equation to analyzing the complexity of algorithms

Simple item page
dc.contributor.author To, Tang Van
dc.date.accessioned 2016-06-15T02:22:49Z
dc.date.available 2016-06-15T02:22:49Z
dc.date.issued 2009
dc.description.abstract Solving recurrence equation (Res) is an important technique in the analysis of algorithms. Especially for the divide and conquer algorithms, establishing the recurrence equations, solving them as well as finding the order of complexity will be discussed. en_US
dc.format.extent 4 pages en_US
dc.format.mimetype application/pdf en_US
dc.identifier.citation International Journal of the Computer, the Internet and management 17.SP1 (March 2009), 17.1-17.4 en_US
dc.identifier.uri https://repository.au.edu/handle/6623004553/17945
dc.language.iso eng en_US
dc.subject Algorithms en_US
dc.subject Solving recurrence equation en_US
dc.subject.other International Journal of the Computer, the Internet and Management
dc.subject.other International Journal of the Computer, the Internet and Management -- 2009
dc.title Linear recurrence equation to analyzing the complexity of algorithms en_US
dc.type Text en_US
mods.genre Journal Article en_US
Files
Collections
International Journal of the Computer, the Internet and management 17.SP1 (March 2009)