Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017
Latest Publications

TOTAL DOCUMENTS

110

(FIVE YEARS 0)

H-INDEX

14

(FIVE YEARS 0)

Published By ACM Press

9781450345286

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Quantum entanglement, sum of squares, and the log rank conjecture

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055488 ◽

2017 ◽

Author(s):

Boaz Barak ◽

Pravesh K. Kothari ◽

David Steurer

Keyword(s):

Quantum Entanglement ◽

Sum Of Squares ◽

Rank Conjecture

Download Full-text

Addition is exponentially harder than counting for shallow monotone circuits

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055425 ◽

2017 ◽

Author(s):

Xi Chen ◽

Igor C. Oliveira ◽

Rocco A. Servedio

Keyword(s):

Monotone Circuits

Download Full-text

Approximate modularity revisited

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055476 ◽

2017 ◽

Author(s):

Uriel Feige ◽

Michal Feldman ◽

Inbal Talgam-Cohen

Download Full-text

Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n 1/2 - ε )-time

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055447 ◽

2017 ◽

Author(s):

Danupon Nanongkai ◽

Thatchaphol Saranurak

Keyword(s):

Las Vegas ◽

Spanning Forest

Download Full-text

Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055461 ◽

2017 ◽

Author(s):

Xi Chen ◽

Erik Waingarten ◽

Jinyu Xie

Keyword(s):

Download Full-text

Non-interactive delegation and batch NP verification from standard computational assumptions

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055497 ◽

2017 ◽

Author(s):

Zvika Brakerski ◽

Justin Holmgren ◽

Yael Kalai

Download Full-text

Sampling random spanning trees faster than matrix multiplication

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055499 ◽

2017 ◽

Author(s):

David Durfee ◽

Rasmus Kyng ◽

John Peebles ◽

Anup B. Rao ◽

Sushant Sachdeva

Keyword(s):

Spanning Trees ◽

Matrix Multiplication

Download Full-text

Linear matroid intersection is in quasi-NC

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055440 ◽

2017 ◽

Author(s):

Rohit Gurjar ◽

Thomas Thierauf

Keyword(s):

Matroid Intersection

Download Full-text

Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055438 ◽

2017 ◽

Author(s):

Pravesh K. Kothari ◽

Raghu Meka ◽

Prasad Raghavendra

Keyword(s):

Download Full-text

Succinct hitting sets and barriers to proving algebraic circuits lower bounds

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055496 ◽

2017 ◽

Author(s):

Michael A. Forbes ◽

Amir Shpilka ◽

Ben Lee Volk

Keyword(s):

Lower Bounds ◽

Download Full-text