Local Reductions


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)
DOI: 10.1007/978-3-662-47672-7_61


2 Figures and Tables


Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Blog articles referencing this paper

  • Local Reductions

    Computational Complexity · Nov 14, 2013

  • Don't see an article that should be here?