共 84 条
[1]
Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms
[J].
2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS),
2016,
:477-486
[2]
Popular conjectures imply strong lower bounds for dynamic problems
[J].
2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014),
2014,
:434-443
[4]
[Anonymous], 2013, P 30 INT S THEOR ASP
[5]
Arar Moab, 2018, P 45 INT C AUT LANG, V79, P1
[6]
Assadi S, 2024, Arxiv, DOI [arXiv:2406.13573, DOI 10.48550/ARXIV.2406.13573]
[7]
On Regularity Lemma and Barriers in Streaming and Dynamic Matching
[J].
PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023,
2023,
:131-144
[8]
Assadi S, 2022, PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, P627
[10]
Assadi Sepehr., 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, P1345