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 proceeding › Conference contribution

55 Downloads (Pure)

Original language	English
Title of host publication	STOC 2020
Subtitle of host publication	Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
Publisher	Association for Computing Machinery (ACM)
Pages	54-67
Number of pages	14
ISBN (Electronic)	978-1-4503-6979-4
DOIs	https://doi.org/10.1145/3357713.3384245
Publication status	Published - Jun 2020

Keywords

@inproceedings{324fe9466e754fffae7a0761965c00a1,

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

keywords = "computational complexity",

author = "Yaroslav Alekseev and Dima Grigoriev and Edward Hirsch and Iddo Tzameret",

year = "2020",

month = jun,

doi = "10.1145/3357713.3384245",

language = "English",

pages = "54--67",

booktitle = "STOC 2020",

publisher = "Association for Computing Machinery (ACM)",

address = "United States",

}

Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative? / Alekseev, Yaroslav; Grigoriev, Dima; Hirsch, Edward et al.
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery (ACM), 2020. p. 54-67.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture

T2 - Can a Natural Number be Negative?

AU - Alekseev, Yaroslav

AU - Grigoriev, Dima

AU - Hirsch, Edward

AU - Tzameret, Iddo

PY - 2020/6

Y1 - 2020/6

KW - computational complexity

U2 - 10.1145/3357713.3384245

DO - 10.1145/3357713.3384245

M3 - Conference contribution

SP - 54

EP - 67

BT - STOC 2020

PB - Association for Computing Machinery (ACM)

ER -