Paper: First-Order Reasoning and Efficient Semi-Algebraic Proofs (at LICS 2021)

Authors: Bit-complexity in Sums-of-Squares and Polynomial Calculus. 1-7 Fedor Part Neil Thapen Iddo Tzameret

Abstract

No Abstract Available

BibTeX

  @InProceedings{PartThapenTzameret-FirstOrderReasoning,
    author = 	 {Bit-complexity in Sums-of-Squares and Polynomial Calculus. 1-7 Fedor Part and Neil Thapen and Iddo Tzameret},
    title = 	 {First-Order Reasoning and Efficient Semi-Algebraic Proofs},
    booktitle =  {Proceedings of the Thirty sixth Annual IEEE Symposium on Logic in Computer Science (LICS 2021)},
    year =	 {2021},
    month =	 {June}, 
    pages =      {1--13},
    location =   {Rome, Italy}, 
    publisher =	 {IEEE Computer Society Press}
  }