{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:40:31Z","timestamp":1743086431042,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031770180"},{"type":"electronic","value":"9783031770197"}],"license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-77019-7_21","type":"book-chapter","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T20:48:21Z","timestamp":1732222101000},"page":"368-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Quantum-Inspired Mechanical Method for Proving of Ramsey\u2019s Theorem by\u00a0Symbolic Computation over the Finite Field GF(2)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9728-1114","authenticated-orcid":false,"given":"Zhenbing","family":"Zeng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0487-259X","authenticated-orcid":false,"given":"Jian","family":"Lu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1209-8191","authenticated-orcid":false,"given":"Liangyu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"FP Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem in formal logic. Proc. Lond. Math. Soc. Ser. 2 30(1), 264\u2013286 (1930)","journal-title":"Proc. Lond. Math. Soc. Ser. 2"},{"key":"21_CR2","first-page":"264","volume":"30","author":"R Piskac","year":"2008","unstructured":"Piskac, R., de Moura, L., Bjorner, N.: Deciding effectively propositional logic with equality. Microsoft Res. Tech. Rep. 30, 264\u2013286 (2008)","journal-title":"Microsoft Res. Tech. Rep."},{"issue":"12","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1016\/j.apal.2015.08.002","volume":"166","author":"S Berardi","year":"2015","unstructured":"Berardi, S., Steila, S.: An intuitionistic version of Ramsey\u2019s theorem and its use in program termination. Ann. Pure Appl. Logic 166(12), 1382\u20131406 (2015)","journal-title":"Ann. Pure Appl. Logic"},{"key":"21_CR4","unstructured":"Campos, M., Griffiths, S., Morris, R., Sahasrabudhe, J.: An Exponential Improvement for Diagonal Ramsey (2023). https:\/\/arxiv.org\/pdf\/2303.09521.pdf"},{"key":"21_CR5","volume-title":"Classic Papers in Combinatorics","author":"P Erd\u0151s","year":"2009","unstructured":"Erd\u0151s, P., Szeckers, G.: A combinatorial problem in geometry. In: Gessel, I., Rota, G.C. (eds.) Classic Papers in Combinatorics. Modern Birkh\u00e4user Classics, Birk-h\u00e4user Boston (2009)"},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190190304","volume":"19","author":"BD McKay","year":"1995","unstructured":"McKay, B.D., Radziszowski, S.P.: $$R(4,5)=25$$. J. Graph Theory 19(3), 309\u2013322 (1995)","journal-title":"J. Graph Theory"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/jgt.3190130113","volume":"13","author":"G Exoo","year":"1989","unstructured":"Exoo, G.: A lower bound for r(5, 5). J. Graph Theory 13, 97\u201398 (1989)","journal-title":"J. Graph Theory"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/jgt.22235","volume":"89","author":"V Angeltveit","year":"2018","unstructured":"Angeltveit, V., McKay, B.: $$R(5,5) \\le 48$$. J. Graph Theory 89(1), 5\u201313 (2018)","journal-title":"J. Graph Theory"},{"key":"21_CR9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.108.010501","volume":"108","author":"F Gaitan","year":"2012","unstructured":"Gaitan, F., Clark, L.: Ramsey numbers and adiabatic quantum computing. Phys. Rev. Lett. 108, 010501 (2012)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.032301","volume":"93","author":"H Wang","year":"2016","unstructured":"Wang, H., McKay, B.D.: Determining Ramsey numbers on a quantum computer. Phys. Rev. A 93(3), 032301 (2016)","journal-title":"Phys. Rev. A"},{"key":"21_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.111.130505","volume":"111","author":"Z Bian","year":"2013","unstructured":"Bian, Z., Chuak, F., Macready, W.G., et al.: Experimental determination of Ramsey numbers. Phys. Rev. Lett. 111, 130505 (2013)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(71)90002-1","volume":"11","author":"K Walker","year":"1971","unstructured":"Walker, K.: An upper bound for the Ramsey number $$M(5, 4)$$. J. Comb. Theory Ser. A 11(1), 1\u201310 (1971)","journal-title":"J. Comb. Theory Ser. A"},{"key":"21_CR13","unstructured":"Mackey, J.: Combinatorial remedies. Ph.D. thesis. Department of Mathematics, University of Hawaii (1994)"},{"issue":"12","key":"21_CR14","first-page":"3311","volume":"41","author":"J Lu","year":"2021","unstructured":"Lu, J., Zeng, Z.: A mechanical proof of Ramsey\u2019s theorem via symbolic computation. J. Syst. Sci. Math. Sci. Chin. Ser. 41(12), 3311\u20133323 (2021)","journal-title":"J. Syst. Sci. Math. Sci. Chin. Ser."},{"issue":"9","key":"21_CR15","doi-asserted-by":"publisher","first-page":"3519","DOI":"10.1007\/s11128-016-1363-3","volume":"15","author":"M Ranjbar","year":"2016","unstructured":"Ranjbar, M., Macready, W.G., Clark, L., Gaitan, F.: Generalized Ramsey numbers through adiabatic quantum optimization. Quant. Inf. Process. 15(9), 3519\u20133542 (2016). https:\/\/doi.org\/10.1007\/s11128-016-1363-3","journal-title":"Quant. Inf. Process."},{"key":"21_CR16","unstructured":"Barton, L.: Ramsey Theory (2021). https:\/\/www.cs.umd.edu\/~ gasarch\/ courses\/250\/S22\/slides\/comb\/otherpaperkings.pdf"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0021-9800(68)80024-9","volume":"5","author":"JG Kalbfleisch","year":"1968","unstructured":"Kalbfleisch, J.G., Stanton, R.G.: On the maximal triangle-free edge-chromatic graphs in three colors. J. Comb. Theory 5, 9\u201320 (1968)","journal-title":"J. Comb. Theory"},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0095-8956(82)90055-7","volume":"33","author":"CM Grinstead","year":"1982","unstructured":"Grinstead, C.M., Roberts, S.M.: On the Ramsey numbers $$R(3, 8)$$ and $$R(3, 9)$$. J. Comb. Theory Ser. B 33(1), 27\u201351 (1982)","journal-title":"J. Comb. Theory Ser. B"},{"key":"21_CR19","volume-title":"Ramsey Theory","author":"RL Graham","year":"1990","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory, 2nd edn. Wiley-Interscience (1990)","edition":"2"},{"issue":"7","key":"21_CR20","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1038\/scientificamerican0790-112","volume":"263","author":"RL Graham","year":"1990","unstructured":"Graham, R.L., Spencer, J.H.: Ramsey theory. Sci. Am. 263(7), 112\u2013117 (1990)","journal-title":"Sci. Am."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190160111","volume":"16","author":"BD McKay","year":"1996","unstructured":"McKay, B.D., Min, Z.K.: The value of the Ramsey number $$R(3,8)$$. J. Graph Theory 16, 99\u2013105 (1996)","journal-title":"J. Graph Theory"},{"issue":"4","key":"21_CR22","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)","journal-title":"J. ACM"},{"key":"21_CR23","series-title":"LNCS","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"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77019-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T21:30:26Z","timestamp":1732224626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77019-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"ISBN":["9783031770180","9783031770197"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77019-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"22 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2024.cs.ait.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}