On the Number of Quantifiers as a Complexity Measure
- Ronald Fagin
- Jonathan Lenchner
- et al.
- 2022
- MFCS 2022
Conference paper
Publications
12 results for Ryan Williams
The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication
- Dirk Van Gucht
- Ryan Williams
- et al.
- 2015
- SIGMOD/PODS 2015
Conference paperImproving exhaustive search implies superpolynomial lower bounds
- Ryan Williams
- 2013
- SIAM Journal on Computing
PaperMaximizing conjunctive views in deletion propagation
- Benny Kimelfeld
- Jan Vondrák
- et al.
- 2012
- ACM TODS
PaperNon-uniform ACC circuit lower bounds
- Ryan Williams
- 2011
- CCC 2011
Conference paperMaximizing conjunctive views in deletion propagation
- Benny Kimelfeld
- Jan Vondrák
- et al.
- 2011
- SIGMOD/PODS 2011
Conference paperAlternation-trading proofs, linear programming, and lower bounds
- Ryan Williams
- 2010
- STACS 2010
Conference paperSubcubic equivalences between path, matrix, and triangle problems
- Virginia Vassilevska Williams
- Ryan Williams
- 2010
- FOCS 2010
Conference paperCommunication complexity with synchronized clocks
- Russell Impagliazzo
- Ryan Williams
- 2010
- CCC 2010
Conference paperImproving exhaustive search implies superpolynomial lower bounds
- Ryan Williams
- 2010
- STOC 2010
Conference paper