As Williams (2010) shows, if there exists an algorithm A that solves Boolean circuit satisfiability in time 2n/ƒ(n) for some superpolynomially growing function ƒ, then NEXPTIME is not a subset of P/poly.
Kako je Vilijams pokazao 2010. godine, ako postoji algoritam A koji rešava Bulov krug zadovoljivosti u vremenu 2n/ƒ(n) za neke superpolinomijalne rastuće funkcije  ƒ, onda NEXPTIME nije podskup P/poly.