Abstract: This paper reveals that the methods to identify essential prime implicants of both ESPRESSO and that proposed by S. Hong, R. Cutier and S. Muroga have the same computational complexity. A method to identify essential primes while generating prime implicants is also given.