Year 2000 problem | Computational fluid dynamics | Waring's problem | The Final Problem | The Problem with Popplers | Hume and the Problem of Causation | Dirichlet problem | computational fluid dynamics | Computational complexity theory | computational chemistry | Boolean satisfiability problem | The Dog Problem | Tammes problem | Species problem | problem solving | Problem gambling | Packing problem | packing problem | IEEE Computational Intelligence Society | Computational Science Graduate Fellowship | Computational Mechanics | Computational mechanics | Computational intelligence | Computational Fluid Dynamics | computational complexity theory | chess problem | Znám's problem | Year 10,000 problem | Yamabe problem | Weber problem |
In 1997 Russell Impagliazzo and Avi Wigderson proved that the construction of Nisan and Wigderson is a pseudorandom generator assuming that there exists a decision problem that can be computed in time 2O(n) on inputs of length n but requires circuits of size 2Ω(n).