Search results
Jump to navigation
Jump to search
- *Lance Fortnow's [http://fortnow.com/lance/complog/ Computational Complexity Web Log]. Includes a 'Complexi4 KB (692 words) - 03:10, 18 November 2012
- ...r, Derrick Coetzee, Matthew Cook, Alex Fabrikant, Craig Feinstein, [[Lance Fortnow]], Oded Goldreich, Lee Graham, Xiaoyang Gu, Dan Gutfreund, Satoshi Hada, Mi2 KB (266 words) - 03:10, 18 November 2012
- Finally, [[Lance Fortnow]] has informed me that [[Complexity Zoo:C#cequalsp|C<sub>=</sub>P]] and its2 KB (315 words) - 03:10, 18 November 2012
- ...n [[http://oldblog.computationalcomplexity.org/2004/01/little-theorem.html Fortnow's weblog]]).21 KB (3,514 words) - 17:35, 7 November 2022
- ...d in [https://blog.computationalcomplexity.org/2004/01/little-theorem.html Fortnow's weblog]).42 KB (6,897 words) - 15:10, 12 April 2024
- L. Antuñes, L. Fortnow, and D. van Melkebeek. ...s.uchicago.edu/~fortnow/papers/depth-j.pdf https://people.cs.uchicago.edu/~fortnow/papers/depth-j.pdf]165 KB (23,490 words) - 20:04, 9 May 2024
- ...Complexity Zoo:N#np|NP]] = PFCHK(log n) relative to all possible oracles. Fortnow [[zooref#for94|[For94]]] observes that the answer depends on what oracle ac60 KB (9,966 words) - 06:14, 21 September 2023