Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture : Can a Natural Number be Negative? / Yaroslav, Alekseev; Grigoriev, Dima; Hirsch, Edward; Tzameret, Iddo.

Proceedings of the 52th Annual ACM Symposium on the Theory of Computing (STOC), 2020. Vol. 52 Association for Computing Machinery (ACM), 2020.

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

Forthcoming

Standard

Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture : Can a Natural Number be Negative? / Yaroslav, Alekseev; Grigoriev, Dima; Hirsch, Edward; Tzameret, Iddo.

Proceedings of the 52th Annual ACM Symposium on the Theory of Computing (STOC), 2020. Vol. 52 Association for Computing Machinery (ACM), 2020.

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

Harvard

Yaroslav, A, Grigoriev, D, Hirsch, E & Tzameret, I 2020, Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative? in Proceedings of the 52th Annual ACM Symposium on the Theory of Computing (STOC), 2020. vol. 52, Association for Computing Machinery (ACM).

APA

Yaroslav, A., Grigoriev, D., Hirsch, E., & Tzameret, I. (Accepted/In press). Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative? In Proceedings of the 52th Annual ACM Symposium on the Theory of Computing (STOC), 2020 (Vol. 52). Association for Computing Machinery (ACM).

Vancouver

Yaroslav A, Grigoriev D, Hirsch E, Tzameret I. Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative? In Proceedings of the 52th Annual ACM Symposium on the Theory of Computing (STOC), 2020. Vol. 52. Association for Computing Machinery (ACM). 2020

Author

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

BibTeX

@inproceedings{324fe9466e754fffae7a0761965c00a1,
title = "Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative?",
keywords = "computational complexity",
author = "Alekseev Yaroslav and Dima Grigoriev and Edward Hirsch and Iddo Tzameret",
year = "2020",
month = feb
day = "6",
language = "English",
volume = "52",
booktitle = "Proceedings of the 52th Annual ACM Symposium on the Theory of Computing (STOC), 2020",
publisher = "Association for Computing Machinery (ACM)",
address = "United States",

}

RIS

TY - GEN

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

T2 - Can a Natural Number be Negative?

AU - Yaroslav, Alekseev

AU - Grigoriev, Dima

AU - Hirsch, Edward

AU - Tzameret, Iddo

PY - 2020/2/6

Y1 - 2020/2/6

KW - computational complexity

M3 - Conference contribution

VL - 52

BT - Proceedings of the 52th Annual ACM Symposium on the Theory of Computing (STOC), 2020

PB - Association for Computing Machinery (ACM)

ER -