I'm wondering what the best method obtained for the Valiant-Vazirani theorem is. We can state the following criteria:
(1) First and foremost, has anyone been able to derandomize it?
(2) If not, what is the best running time for converting a SAT instances? And how does this method work? Can we somehow do better than the technique mentioned here?
(3) Out of curiosity, I'd also like to know the size bounds of the converted SAT formula.
The reason I ask is that I'm studying an algorithm that makes use of this, so I'd like to have the best technique available.