{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:10:16Z","timestamp":1742998216018,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_12","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"157-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lower Bounds of\u00a0Functions on\u00a0Finite Abelian Groups"],"prefix":"10.1007","author":[{"given":"Jianting","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihong","family":"Zhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"12_CR1","unstructured":"ApS, M.: The MOSEK optimization toolbox for MATLAB manual. Version 9.3.11 (2019). https:\/\/docs.mosek.com\/9.3\/toolbox\/index.html"},{"key":"12_CR2","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group (1976)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: STOC\u201914\u2013Proceedings of the 2014 ACM Symposium on Theory of Computing, pp. 624\u2013633. ACM, New York (2014)","DOI":"10.1145\/2591796.2591884"},{"issue":"1\u20132","key":"12_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10107-015-0977-z","volume":"160","author":"H Fawzi","year":"2016","unstructured":"Fawzi, H., Saunderson, J., Parrilo, P.A.: Sparse sums of squares on finite abelian groups and improved semidefinite lifts. Math. Program. 160(1\u20132), 149\u2013191 (2016)","journal-title":"Math. Program."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Feige, U., Goemans, M.: Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT. In: Proceedings Third Israel Symposium on the Theory of Computing and Systems, pp. 182\u2013189 (1995)","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Fulton, W., Harris, J.: Representation Theory: A First Course, vol. 129. Springer Science & Business Media, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4612-0979-9","DOI":"10.1007\/978-1-4612-0979-9"},{"issue":"6","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"issue":"6","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42(6), 1115\u20131145 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Karloff, H., Zwick, U.: A 7\/8-approximation algorithm for MAX 3SAT? In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 406\u2013415 (1997)","DOI":"10.1109\/SFCS.1997.646129"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. The IBM Research Symposia Series. Springer, Boston, MA (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput. 37(1), 319\u2013357 (2007)","journal-title":"SIAM J. Comput."},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Korte, B.H., Vygen, J., Korte, B., Vygen, J.: Combinatorial Optimization, vol. 1. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24488-9","DOI":"10.1007\/978-3-642-24488-9"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","volume":"36","author":"MW Krentel","year":"1988","unstructured":"Krentel, M.W.: The complexity of optimization problems. J. Comput. Syst. Sci. 36(3), 490\u2013509 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.orl.2015.12.014","volume":"44","author":"JB Lasserre","year":"2016","unstructured":"Lasserre, J.B.: A max-cut formulation of 0\/1 programs. Oper. Res. Lett. 44(2), 158\u2013164 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the sherali-adams, lov\u00e1sz-schrijver, and lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28(3), 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-47867-1_6","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Lewin","year":"2002","unstructured":"Lewin, M., Livnat, D., Zwick, U.: Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 67\u201382. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-47867-1_6"},{"key":"12_CR19","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Inc., Hoboken (1990)"},{"issue":"1","key":"12_CR20","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1112\/plms\/s1-28.1.486","volume":"1","author":"GB Mathews","year":"1896","unstructured":"Mathews, G.B.: On the partition of numbers. Proc. Lond. Math. Soc. 1(1), 486\u2013490 (1896)","journal-title":"Proc. Lond. Math. Soc."},{"key":"12_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean functions","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R.: Analysis of Boolean functions. Cambridge University Press, New York (2014)"},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The Euclidean traveling salesman problem is $$NP$$-complete. Theor. Comput. Sci. 4(3), 237\u2013244 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR23","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Publishing Company, Reading, Boston, MA (1994)"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-030-80223-3_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2021","author":"M Py","year":"2021","unstructured":"Py, M., Cherif, M.S., Habet, D.: A proof builder for Max-SAT. In: Li, C.-M., Many\u00e0, F. (eds.) SAT 2021. LNCS, vol. 12831, pp. 488\u2013498. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80223-3_33"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Raghavendra, P.: Optimal algorithms and inapproximability results for every CSP? [extended abstract]. In: STOC\u201908, pp. 245\u2013254. ACM, New York (2008)","DOI":"10.1145\/1374376.1374414"},{"key":"12_CR26","unstructured":"Rudin, W.: Fourier Analysis on Groups, vol. 121967. Wiley Online Library, Hoboken (1962)"},{"issue":"1","key":"12_CR27","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1137\/16M105544X","volume":"27","author":"S Sakaue","year":"2017","unstructured":"Sakaue, S., Takeda, A., Kim, S., Ito, N.: Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems. SIAM J. Optim. 27(1), 565\u2013582 (2017)","journal-title":"SIAM J. Optim."},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Slav\u00edk, P.: A tight analysis of the greedy algorithm for set cover. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), pp. 435\u2013441. ACM, New York (1996)","DOI":"10.1145\/237814.237991"},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10107-021-01745-9","volume":"197","author":"L Slot","year":"2023","unstructured":"Slot, L., Laurent, M.: Sum-of-squares hierarchies for binary polynomial optimization. Math. Program. 197(2), 621\u2013660 (2023)","journal-title":"Math. Program."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Sun, D., Toh, K.C., Yuan, Y., Zhao, X.Y.: SDPNAL+: a Matlab software for semidefinite programming with bound constraints (version 1.0). Optim. Methods Softw. 35(1), 87\u2013115 (2020)","DOI":"10.1080\/10556788.2019.1576176"},{"issue":"10","key":"12_CR31","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1016\/j.dam.2007.08.036","volume":"156","author":"H van Maaren","year":"2008","unstructured":"van Maaren, H., van Norden, L., Heule, M.: Sums of squares based approximation algorithms for max-sat. Discret. Appl. Math. 156(10), 1754\u20131779 (2008)","journal-title":"Discret. Appl. Math."},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Vazirani, V.V.: Approximation Algorithms, vol. 1. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04565-7","DOI":"10.1007\/978-3-662-04565-7"},{"issue":"1","key":"12_CR33","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H Waki","year":"2006","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17(1), 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"12_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3569709","volume":"48","author":"J Wang","year":"2022","unstructured":"Wang, J., Magron, V., Lasserre, J.B., Mai, N.H.A.: CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization. ACM Trans. Math. Softw. 48(4), 1\u201326 (2022)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"12_CR35","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/19M1307871","volume":"31","author":"J Wang","year":"2021","unstructured":"Wang, J., Magron, V., Lasserre, J.B.: TSSOS: a moment-SOS hierarchy that exploits term sparsity. SIAM J. Optim. 31(1), 30\u201358 (2021)","journal-title":"SIAM J. Optim."},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Wang, P.W., Kolter, J.Z.: Low-rank semidefinite programming for the MAX2SAT problem. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 1641\u20131649 (2019)","DOI":"10.1609\/aaai.v33i01.33011641"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Yang, J., Ye, K., Zhi, L.: Lower bounds of functions on finite abelian groups (2023)","DOI":"10.1007\/978-3-031-49193-1_12"},{"key":"12_CR38","unstructured":"Yang, J., Ye, K., Zhi, L.: Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time. arXiv preprint arXiv:2201.03912 (2022)"},{"key":"12_CR39","unstructured":"Yang, J., Ye, K., Zhi, L.: Short certificates for MAX-SAT via Fourier sum of squares. arXiv preprint arXiv:2207.08076 (2022)"},{"issue":"1","key":"12_CR40","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-020-01516-y","volume":"188","author":"RY Zhang","year":"2021","unstructured":"Zhang, R.Y., Lavaei, J.: Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion. Math. Program. 188(1), 351\u2013393 (2021)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T16:28:04Z","timestamp":1730824084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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","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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}