Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving

Author: Hasan Osman  

Publisher: Springer Publishing Company

ISSN: 1000-9000

Source: Journal of Computer Science and Technology, Vol.25, Iss.6, 2010-11, pp. : 1305-1320

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract