# Strongest known version of Baker's theorem

The article I have checked for Baker's theorem is Waldschmidt's. But the article and the citations therein are from the time of '88. Question:

What is the the strongest known lower bound for Baker's theorem on linear forms on logarithms?

There is a big difference between linear forms in many logarithms and in two (or three) logarithms. The first case is covered in the archimedean case by the work of E. Matveev; Matveev's original works are hard even to specialists but there is a very nice survey [Yu. Nesterenko, Linear forms in logarithms of rational numbers, in Diophantine approximation (Cetraro, 2000), 53--106, Lecture Notes in Math., 1819, Springer, Berlin, 2003. MR2009829 (2004i:11082)]. The $p$-adic case was mostly done by Kunrui Yu. The best estimate for the case of two logarithms, which is of importance because of Tijdeman's application to Catalan's equation, is given in [M. Laurent, M. Mignotte et Y. Nesterenko, Formes linéaires en deux logarithmes et déterminants d'interpolation, J. Number Theory 55 (1995), no. 2, 285--321. MR1366574 (96h:11073)]. The latest news in the last direction (also in relation to Catalan's) are reviewed in [M. Mignotte, Linear forms in two and three logarithms and interpolation determinants. Diophantine equations, 151--166, Tata Inst. Fund. Res. Stud. Math., 20, Tata Inst. Fund. Res., Mumbai, 2008. MR1500224 (2010h:11119)]