Articles by R. Ryan Williams
|
Vol 14, Article 17 (pp 1-25)
New Algorithms and Lower Bounds for Circuits With Linear Threshold Gates by R. Ryan Williams |
|
Vol 13, Article 4 (pp 1-22)
On the (Non) NP-Hardness of Computing Circuit Complexity by Cody D. Murray and R. Ryan Williams |
|
Vol 8, Article 4 (pp 69-94)
[Motwani Special Issue]
Regularity Lemmas and Combinatorial Algorithms by Nikhil Bansal and R. Ryan Williams |
|
Vol 5, Article 9 (pp 173-189)
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time by Virginia Vassilevska, R. Ryan Williams, and Raphael Yuster |