| http://www.w3.org/ns/prov#value | - One of the best student papers from FOCS by Hertli gave a new best exponential upper bound for 3-SAT of the form something like 1.30704^n which improves the best constant in the base from 1.32065 and does this in a memorable way. (Though unlike 3/2, I would have had little idea whether 1.30704 was an improvement, especially since some of these results are stated using the log_2 of the base.) The t
|
