Improving the complexity of Brocard's problem?

Question

Brocard\'s problem is n! + 1 = m^2. The solutions to this problems are pairs of integers called Brown numbers (4,5), etc, of which only three are k