Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative?

Yaroslav Alekseev, Dima Grigoriev, Edward Hirsch, Iddo Tzameret

Research output: Chapter in Book/Report/Conference proceedingConference contribution

53 Downloads (Pure)
Original languageEnglish
Title of host publicationSTOC 2020
Subtitle of host publicationProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
PublisherAssociation for Computing Machinery (ACM)
Pages54-67
Number of pages14
ISBN (Electronic)978-1-4503-6979-4
DOIs
Publication statusPublished - Jun 2020

Keywords

  • computational complexity

Cite this