What is an upper bound on formula size when converting 3-SAT to UNIQUE 3-SAT?We can use the Valiant Vazirani Therom, also found here (in more detail).Essentially, it is a randomized algorithm that converts a SAT formula into another SAT formula that has only 1 satisfying variable assignment (called UNIQUE-SAT) with high probability.I'm wondering what the upper bounds are on the size of the formula.  The information I have proves that it is polynomial, but I hope we can get more specific.  Can anyone find a more exact upper bounds?
What is an upper bound on formula size when converting 3-SAT to UNIQUE 3-SAT?
complexity theory;reductions;3 sat