{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:52:31Z","timestamp":1742914351472,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-38906-1_16","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"232-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness of\u00a0Graph-Structured Algebraic and\u00a0Symbolic Problems"],"prefix":"10.1007","author":[{"given":"Jingbang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runze","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Alon, N., Yuster, R.: Solving linear systems through nested dissection. In: FOCS 2010, pp. 225\u2013234. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/FOCS.2010.28","DOI":"10.1109\/FOCS.2010.28"},{"key":"16_CR2","unstructured":"Chen, J., Gao, Y., Huang, Y., Peng, R., Wang, R.: Hardness of graph-structured algebraic and symbolic problems (2022). https:\/\/arxiv.org\/abs\/2109.12736v3"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Cheung, H.Y., Lau, L.C., Leung, K.M.: Graph connectivities, network coding, and expander graphs. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 190\u2013199. IEEE (2011)","DOI":"10.1109\/FOCS.2011.55"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., et al.: Solving directed Laplacian systems in nearly-linear time through sparse LU factorizations. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 898\u2013909. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00089"},{"key":"16_CR5","unstructured":"Daitch, S.I., Spielman, D.A.: Support-graph preconditioners for 2-dimensional trusses. CoRR abs\/cs\/0703119 (2007). http:\/\/arxiv.org\/abs\/cs\/0703119"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Daitch, S.I., Spielman, D.A.: Faster approximate Lossy generalized flow via interior point algorithms. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 451\u2013460. Association for Computing Machinery, New York (2008). https:\/\/doi.org\/10.1145\/1374376.1374441","DOI":"10.1145\/1374376.1374441"},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Demillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193\u2013195 (1978). https:\/\/doi.org\/10.1016\/0020-0190(78)90067-4. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0020019078900674","DOI":"10.1016\/0020-0190(78)90067-4"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF01459082","volume":"40","author":"JD Dixon","year":"1982","unstructured":"Dixon, J.D.: Exact solution of linear equations using P-adic expansions. Numer. Math. 40(1), 137\u2013141 (1982)","journal-title":"Numer. Math."},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"A George","year":"1973","unstructured":"George, A.: Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10(2), 345\u2013363 (1973). https:\/\/doi.org\/10.1137\/0710032","journal-title":"SIAM J. Numer. Anal."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Jambulapati, A., Sidford, A.: Ultrasparse ultrasparsifiers and faster Laplacian system solvers. In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, pp. 540\u2013559. Society for Industrial and Applied Mathematics, USA (2021)","DOI":"10.1137\/1.9781611976465.33"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 355\u2013364. Association for Computing Machinery, New York (2003). https:\/\/doi.org\/10.1145\/780542.780595","DOI":"10.1145\/780542.780595"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Kelner, J.A., Orecchia, L., Sidford, A., Zhu, Z.A.: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 911\u2013920 (2013)","DOI":"10.1145\/2488608.2488724"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Koutis, I., Miller, G.L., Peng, R.: A nearly-m log n time solver for SDD linear systems. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 590\u2013598 (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.85","DOI":"10.1109\/FOCS.2011.85"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1137\/110845914","volume":"43","author":"I Koutis","year":"2014","unstructured":"Koutis, I., Miller, G.L., Peng, R.: Approaching optimality for solving SDD linear systems. SIAM J. Comput. 43(1), 337\u2013354 (2014)","journal-title":"SIAM J. Comput."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Kyng, R., Lee, Y.T., Peng, R., Sachdeva, S., Spielman, D.A.: Sparsified Cholesky and multigrid solvers for connection Laplacians. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 842\u2013850 (2016)","DOI":"10.1145\/2897518.2897640"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Kyng, R., Peng, R., Schwieterman, R., Zhang, P.: Incomplete nested dissection. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 404\u2013417 (2018)","DOI":"10.1145\/3188745.3188960"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Kyng, R., Zhang, P.: Hardness results for structured linear systems. SIAM J. Comput. 49(4), FOCS17-280 (2020)","DOI":"10.1137\/17M1161774"},{"key":"16_CR18","unstructured":"Lee, Y.T., Sidford, A.: Solving linear programs with Sqrt (rank) linear system solves. arXiv preprint arXiv:1910.08033 (2019)"},{"issue":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM J. Numer. Anal. 16(2), 346\u2013358 (1979). https:\/\/doi.org\/10.1137\/0716027","journal-title":"SIAM J. Numer. Anal."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Nie, Z.: Matrix anti-concentration inequalities with applications. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 568\u2013581 (2022)","DOI":"10.1145\/3519935.3520060"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-39757-4_20","volume-title":"Advances in Cryptology","author":"AM Odlyzko","year":"1985","unstructured":"Odlyzko, A.M.: Discrete logarithms in finite fields and their cryptographic significance. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 224\u2013314. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39757-4_20"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Peng, R., Vempala, S.S.: Solving sparse linear systems faster than matrix multiplication. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 504\u2013521. SIAM (2021)","DOI":"10.1137\/1.9781611976465.31"},{"key":"16_CR23","first-page":"49","volume":"99","author":"N Saxena","year":"2009","unstructured":"Saxena, N.: Progress on polynomial identity testing. Bull. EATCS 99, 49\u201379 (2009)","journal-title":"Bull. EATCS"},{"key":"16_CR24","series-title":"Progress in Computer Science and Applied Logic","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-319-05446-9_7","volume-title":"Perspectives in Computational Complexity","author":"N Saxena","year":"2014","unstructured":"Saxena, N.: Progress on polynomial identity testing-II. In: Agrawal, M., Arvind, V. (eds.) Perspectives in Computational Complexity. PCSAL, vol. 26, pp. 131\u2013146. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05446-9_7"},{"issue":"4","key":"16_CR25","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980). https:\/\/doi.org\/10.1145\/322217.322225","journal-title":"J. ACM"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Shpilka, A., Yehudayoff, A.: Arithmetic circuits: a survey of recent results and open questions. Found. Trends\u00ae Theor. Comput. Sci. 5(3\u20134), 207\u2013388 (2010)","DOI":"10.1561\/0400000039"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 81\u201390 (2004)","DOI":"10.1145\/1007352.1007372"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Storjohann, A.: The shifted number system for fast linear algebra on integer matrices. J. Complex. 21(4), 609\u2013650 (2005). https:\/\/doi.org\/10.1016\/j.jco.2005.04.002. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0885064X05000312. Festschrift for the 70th Birthday of Arnold Schonhage","DOI":"10.1016\/j.jco.2005.04.002"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. s1\u201322(2), 107\u2013111 (1947). https:\/\/doi.org\/10.1112\/jlms\/s1-22.2.107","DOI":"10.1112\/jlms\/s1-22.2.107"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Completeness classes in algebra. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 249\u2013261 (1979)","DOI":"10.1145\/800135.804419"},{"key":"16_CR31","unstructured":"Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using gaussian fields and harmonic functions. In: Proceedings of the Twentieth International Conference on International Conference on Machine Learning, ICML 2003, pp. 912\u2013919. AAAI Press (2003)"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Zomorodian, A., Carlsson, G.: Computing persistent homology. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 347\u2013356 (2004)","DOI":"10.1145\/997817.997870"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:07:16Z","timestamp":1690474036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}