Highly Influenced

We reduce non-deterministic time T ≥ 2n to a 3SAT instance φ of size |φ| = T · log T such that there is an explicit circuit C that on input an index i of log |φ| bits outputs the ith clause, and each output bit of C depends on O(1) inputs bits. The previous best result was C in NC1. Even in the simpler setting of |φ| = poly(T ) the previous best result was… (More)

Citations per Year

Averaging **7 citations** per year over the last 3 years.