Paper: Monomial size vs Bit-complexity in Sums-of-Squares and Polynomial Calculus (at LICS 2021)

Authors: Tuomas Hakoniemi

Abstract

No Abstract Available

BibTeX

  @InProceedings{Hakoniemi-MonomialsizevsBitco,
    author = 	 {Tuomas Hakoniemi},
    title = 	 {Monomial size vs Bit-complexity in Sums-of-Squares and Polynomial Calculus},
    booktitle =  {Proceedings of the Thirty sixth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2021)},
    year =	 {2021},
    month =	 {June}, 
    pages =      {1--7},
    location =   {Rome, Italy}, 
    publisher =	 {ACM}
  }