{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T21:15:28Z","timestamp":1762377328082,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031280726"},{"type":"electronic","value":"9783031280733"}],"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-28073-3_23","type":"book-chapter","created":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T06:04:47Z","timestamp":1677650687000},"page":"328-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The P vs. NP Problem and\u00a0Attempts to\u00a0Settle It via\u00a0Perfect Graphs State-of-the-Art Approach"],"prefix":"10.1007","author":[{"given":"Maher","family":"Heal","sequence":"first","affiliation":[]},{"given":"Kia","family":"Dashtipour","sequence":"additional","affiliation":[]},{"given":"Mandar","family":"Gogate","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"key":"23_CR1","unstructured":"Carlson, J.A., Jaffe, A., Wiles, A.: The millennium prize problems. Cambridge, MA, American Mathematical Society, Providence, RI, Clay Mathematics Institute (2006)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: P, NP, and NP-Completeness: The basics of computational complexity. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511761355"},{"key":"23_CR3","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, vol. 174. San Francisco: freeman (1979)"},{"issue":"9","key":"23_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1562164.1562186","volume":"52","author":"L Fortnow","year":"2009","unstructured":"Fortnow, L.: The status of the P versus NP problem. Commun. ACM 52(9), 78\u201386 (2009)","journal-title":"Commun. ACM"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"T Baker","year":"1975","unstructured":"Baker, T., Gill, J., Solovay, R.: Relativizations of the P=?NP question. SIAM J. Comput. 4(4), 431\u2013442 (1975)","journal-title":"SIAM J. Comput."},{"key":"23_CR6","unstructured":"Razborov, A.A.: Lower bounds for the monotone complexity of some Boolean functions. Soviet Math. Dokl. vol. 31 (1985)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Razborov, A.A.: On the method of approximations. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (1989)","DOI":"10.1145\/73007.73023"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M Furst","year":"1984","unstructured":"Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17(1), 13\u201327 (1984)","journal-title":"Math. Syst. Theory"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Theoret. Comput. Sci. 39, 297\u2013308 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR10","unstructured":"Berge, C.: Farbung von Graphen, deren samtliche bzw. deren ungerade Kreise starr sind. Wissenschaftliche Zeitschrift (1961)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Robertson, N., et al.: The strong perfect graph theorem. Ann. Math. 164(1), 51\u2013229 (2006)","DOI":"10.4007\/annals.2006.164.51"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Heal, M.H.: Simple proofs of the strong perfect graph theorem using polyhedral approaches and proving P= NP as a conclusion. In: 2020 International Conference on Computational Science and Computational Intelligence (CSCI). IEEE (2020)","DOI":"10.1109\/CSCI51800.2020.00274"},{"key":"23_CR13","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, vol. 2. Springer Science & Business Media (2012)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Heal, M., Li, J.: Finding the maximal independent sets of a graph including the maximum using a multivariable continuous polynomial objective optimization formulation. In: Science and Information Conference. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-52249-0_9"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Brinkmann, G., Coolsaet, K., Goedgebeur, J., M\u00e9lot, H.: House of Graphs: a database of interesting graphs. Discrete Appl. Math. 161(1\u20132), 311\u2013314 (2013). http:\/\/hog.grinvin.org","DOI":"10.1016\/j.dam.2012.07.018"}],"container-title":["Lecture Notes in Networks and Systems","Advances in Information and Communication"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-28073-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T06:08:55Z","timestamp":1677650935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-28073-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031280726","9783031280733"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-28073-3_23","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FICC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Future of Information and Communication Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","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":"2 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ficc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}