Invited Paper: Complexity Lower Bounds from Algorithm Design (at LICS 2021)

Authors: R. Ryan Williams

Abstract

No Abstract Available

BibTeX

  @InProceedings{Williams-ComplexityLowerBoun,
    author = 	 {R. Ryan Williams},
    title = 	 {Complexity Lower Bounds from Algorithm Design},
    booktitle =  {Proceedings of the Thirty sixth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2021)},
    year =	 {2021},
    month =	 {June}, 
    pages =      {1--3},
    location =   {Rome, Italy}, 
    note =       {Invited Talk},
    publisher =	 {ACM}
  }