{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T09:56:08Z","timestamp":1769162168558,"version":"3.49.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031937057","type":"print"},{"value":"9783031937064","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-93706-4_5","type":"book-chapter","created":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T17:22:49Z","timestamp":1749316969000},"page":"72-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Strong Structural Bounds for\u00a0MaxSAT: The Fine Details of\u00a0Using Neuromorphic and\u00a0Quantum Hardware Accelerators"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6475-5512","authenticated-orcid":false,"given":"Max","family":"Bannach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4659-6201","authenticated-orcid":false,"given":"Jai","family":"Grover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0131-6771","authenticated-orcid":false,"given":"Markus","family":"Hecher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,8]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Akopyan, F., et al.: TrueNorth: design and tool flow of a 65 mW 1 million neuron programmable neurosynaptic chip. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 34(10), 1537\u20131557 (2015). https:\/\/doi.org\/10.1109\/TCAD.2015.2474396","DOI":"10.1109\/TCAD.2015.2474396"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Al-Hraishawi, H., ur\u00a0Rehman, J., Chatzinotas, S.: Quantum optimization algorithm for LEO satellite communications based on cell-free massive MIMO. In: IEEE International Conference on Communications, ICC 2023 - Workshops, Rome, Italy, 28 May\u20131 June 2023, pp. 1759\u20131764 (2023). https:\/\/doi.org\/10.1109\/ICCWORKSHOPS57953.2023.10283753","DOI":"10.1109\/ICCWORKSHOPS57953.2023.10283753"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Alom, M.Z., Essen, B.V., Moody, A.T., Widemann, D.P., Taha, T.M.: Quadratic unconstrained binary optimization (QUBO) on neuromorphic computing system. In: 2017 International Joint Conference on Neural Networks, IJCNN 2017, Anchorage, AK, USA, 14\u201319 May 2017, pp. 3922\u20133929 (2017). https:\/\/doi.org\/10.1109\/IJCNN.2017.7966350","DOI":"10.1109\/IJCNN.2017.7966350"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Alves-Martins, W., et al.: Satellite adaptive onboard beamforming using neuromorphic processors. In: IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. IEEE, Washington, USA (2024)","DOI":"10.1109\/PIMRC59610.2024.10817450"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Ans\u00f3tegui, C., Levy, J.: Reducing SAT to Max2SAT. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event\/Montreal, Canada, 19\u201327 August 2021, pp. 1367\u20131373 (2021). https:\/\/doi.org\/10.24963\/IJCAI.2021\/189","DOI":"10.24963\/IJCAI.2021\/189"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Ans\u00f3tegui, C., Levy, J.: SAT, Gadgets, Max2XOR, and Quantum Annealers. CoRR abs\/2403.00182 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2403.00182","DOI":"10.48550\/ARXIV.2403.00182"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Bannach, M., Hecher, M.: Structure-guided cube-and-conquer for MaxSAT. In: NASA Formal Methods - 16th International Symposium, NFM 2024, Moffett Field, CA, USA, 4\u20136 June 2024, Proceedings, pp. 3\u201320 (2024). https:\/\/doi.org\/10.1007\/978-3-031-60698-4_1","DOI":"10.1007\/978-3-031-60698-4_1"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-66167-4_9","volume-title":"Frontiers of Combining Systems","author":"Z Bian","year":"2017","unstructured":"Bian, Z., Chudak, F., Macready, W., Roy, A., Sebastiani, R., Varotti, S.: Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 153\u2013171. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66167-4_9"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-03898-8_5","volume-title":"Parameterized and Exact Computation","author":"HL Bodlaender","year":"2013","unstructured":"Bodlaender, H.L., Bonsma, P., Lokshtanov, D.: The fine details of fast dynamic programming over tree decompositions. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 41\u201353. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_5"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-24318-4_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"S Bova","year":"2015","unstructured":"Bova, S., Capelli, F., Mengel, S., Slivovsky, F.: On compiling CNFs into structured deterministic DNNFs. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 199\u2013214. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_15"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Capelli, F., Mengel, S.: Tractable QBF by knowledge compilation. In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, Berlin, Germany, 13\u201316 March 2019, pp. 18:1\u201318:16 (2019). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2019.18","DOI":"10.4230\/LIPICS.STACS.2019.18"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"37107","DOI":"10.1038\/srep37107","volume":"6","author":"N Chancellor","year":"2016","unstructured":"Chancellor, N., Zohren, S., Warburton, P.A., Benjamin, S.C., Roberts, S.: A direct mapping of max k-SAT and high order parity checks to a chimera graph. Sci. Rep. 6(1), 37107 (2016)","journal-title":"Sci. Rep."},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Codognet, P.: Encoding the at-most-one constraint for QUBO and quantum annealing: experiments with the N-queens problem. In: Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, 15\u201319 July 2023, pp. 2195\u20132202 (2023). https:\/\/doi.org\/10.1145\/3583133.3596394","DOI":"10.1145\/3583133.3596394"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Codognet, P.: Comparing QUBO models for quantum annealing: integer encodings for permutation problems. Int. Trans. Oper. Res. (2024)","DOI":"10.1111\/itor.13471"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-030-19212-9_11","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"C Coffrin","year":"2019","unstructured":"Coffrin, C., Nagarajan, H., Bent, R.: Evaluating ising processing units with integer programming. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 163\u2013181. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_11"},{"key":"5_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/S11128-019-2236-3","volume":"18","author":"P Date","year":"2019","unstructured":"Date, P., Patton, R.M., Schuman, C.D., Potok, T.E.: Efficiently embedding QUBO problems on adiabatic quantum computers. Quantum Inf. Process. 18(4), 117 (2019). https:\/\/doi.org\/10.1007\/S11128-019-2236-3","journal-title":"Quantum Inf. Process."},{"issue":"5","key":"5_CR18","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/JPROC.2021.3067593","volume":"109","author":"M Davies","year":"2021","unstructured":"Davies, M., et al.: Advancing neuromorphic computing with Loihi: a survey of results and outlook. Proc. IEEE 109(5), 911\u2013934 (2021). https:\/\/doi.org\/10.1109\/JPROC.2021.3067593","journal-title":"Proc. IEEE"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90059-1","journal-title":"Theor. Comput. Sci."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2022.3199267","volume":"3","author":"A Guillaume","year":"2022","unstructured":"Guillaume, A., et al.: Deep space network scheduling using quantum annealing. IEEE Trans. Quantum Eng. 3, 1\u201313 (2022)","journal-title":"IEEE Trans. Quantum Eng."},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3233\/SAT190116","volume":"11","author":"A Ignatiev","year":"2019","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: RC2: an Efficient MaxSAT Solver. J. Satisf. Boolean Model. Comput. 11(1), 53\u201364 (2019). https:\/\/doi.org\/10.3233\/SAT190116","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"7346","key":"5_CR22","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson, M.W., et al.: Quantum annealing with manufactured spins. Nature 473(7346), 194\u2013198 (2011)","journal-title":"Nature"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"36606","DOI":"10.1109\/ACCESS.2024.3374089","volume":"12","author":"T Kashimata","year":"2024","unstructured":"Kashimata, T., Yamasaki, M., Hidaka, R., Tatsumura, K.: Efficient and scalable architecture for multiple-chip implementation of simulated bifurcation machines. IEEE Access 12, 36606\u201336621 (2024). https:\/\/doi.org\/10.1109\/ACCESS.2024.3374089","journal-title":"IEEE Access"},{"issue":"1\u20132","key":"5_CR24","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1002\/malq.19670130104","volume":"13","author":"MR Krom","year":"1967","unstructured":"Krom, M.R.: The decision problem for a class of first-order formulas in which all disjunctions are binary. Math. Log. Q. 13(1\u20132), 15\u201320 (1967). https:\/\/doi.org\/10.1002\/malq.19670130104","journal-title":"Math. Log. Q."},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Kr\u00fcger, T., Mauerer, W.: Quantum annealing-based software components: an experimental case study with SAT solving. In: ICSE 2020: 42nd International Conference on Software Engineering, Workshops, Seoul, Republic of Korea, 27 June\u201319 July 2020, pp. 445\u2013450 (2020). https:\/\/doi.org\/10.1145\/3387940.3391472","DOI":"10.1145\/3387940.3391472"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-94144-8_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"M Lampis","year":"2018","unstructured":"Lampis, M., Mengel, S., Mitsou, V.: QBF as an alternative to Courcelle\u2019s theorem. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 235\u2013252. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_15"},{"key":"5_CR27","first-page":"41","volume":"105","author":"D Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 105, 41\u201372 (2011)","journal-title":"Bull. EATCS"},{"issue":"3\u20134","key":"5_CR28","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/S10472-011-9233-2","volume":"62","author":"J Marques-Silva","year":"2011","unstructured":"Marques-Silva, J., Argelich, J., Gra\u00e7a, A., Lynce, I.: Boolean lexicographic optimization: algorithms & applications. Ann. Math. Artif. Intell. 62(3\u20134), 317\u2013343 (2011). https:\/\/doi.org\/10.1007\/S10472-011-9233-2","journal-title":"Ann. Math. Artif. Intell."},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Marques-Silva, J., Ignatiev, A., Morgado, A.: Horn maximum satisfiability: reductions, algorithms and applications. In: Progress in Artificial Intelligence - 18th EPIA Conference on Artificial Intelligence, EPIA 2017, Porto, Portugal, 5\u20138 September 2017, Proceedings, pp. 681\u2013694 (2017). https:\/\/doi.org\/10.1007\/978-3-319-65340-2","DOI":"10.1007\/978-3-319-65340-2"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-09284-3_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"R Martins","year":"2014","unstructured":"Martins, R., Manquinho, V., Lynce, I.: Open-WBO: a modular MaxSAT solver. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 438\u2013445. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_33"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Matsubara, S., et al.: Digital annealer for high-speed solving of combinatorial optimization problems and its applications. In: 25th Asia and South Pacific Design Automation Conference, ASP-DAC 2020, Beijing, China, 13\u201316 January 2020, pp. 667\u2013672 (2020). https:\/\/doi.org\/10.1109\/ASP-DAC47756.2020.9045100","DOI":"10.1109\/ASP-DAC47756.2020.9045100"},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Mniszewski, S.M.: Graph partitioning as quadratic unconstrained binary optimization (QUBO) on spiking neuromorphic hardware. In: Proceedings of the International Conference on Neuromorphic Systems, ICONS 2019, Knoxville, Tennessee, USA, 23\u201325 July 2019, pp. 4:1\u20134:5 (2019). https:\/\/doi.org\/10.1145\/3354265.3354269","DOI":"10.1145\/3354265.3354269"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Moraglio, A., Georgescu, S., Sadowski, P.: AutoQubo: data-driven automatic QUBO generation. In: GECCO 2022: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, 9\u201313 July 2022, pp. 2232\u20132239 (2022). https:\/\/doi.org\/10.1145\/3520304.3533965","DOI":"10.1145\/3520304.3533965"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Morse, G., Kozsik, T.: On optimal QUBO encoding of Boolean logic (Max-)3-SAT and (Max-)k-SAT with integer programming. In: Proceedings of the 7th International Conference on Algorithms, Computing and Systems, ICACS 2023, Larissa, Greece, 19\u201321 October 2023, pp. 145\u2013153 (2023). https:\/\/doi.org\/10.1145\/3631908.3631929","DOI":"10.1145\/3631908.3631929"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Naoukin, J., Isik, M., Tiwari, K.: A survey examining neuromorphic architecture in space and challenges from radiation. CoRR abs\/2311.15006 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2311.15006","DOI":"10.48550\/ARXIV.2311.15006"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"N\u00fc\u00dflein, J., Gabor, T., Linnhoff-Popien, C., Feld, S.: Algorithmic QUBO formulations for k-SAT and Hamiltonian cycles. In: GECCO 2022: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, 9\u201313 July 2022, pp. 2240\u20132246 (2022). https:\/\/doi.org\/10.1145\/3520304.3533952","DOI":"10.1145\/3520304.3533952"},{"key":"5_CR37","doi-asserted-by":"publisher","unstructured":"N\u00fc\u00dflein, J., Zielinski, S., Gabor, T., Linnhoff-Popien, C., Feld, S.: Solving (Max) 3-SAT via quadratic unconstrained binary optimization. In: Computational Science - ICCS 2023 - 23rd International Conference, Prague, Czech Republic, 3\u20135 July 2023, Proceedings, Part V, pp. 34\u201347 (2023). https:\/\/doi.org\/10.1007\/978-3-031-36030-5_3","DOI":"10.1007\/978-3-031-36030-5_3"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Ortiz, F., et al.: Energy-efficient on-board radio resource management for satellite communications via neuromorphic computing. IEEE Trans. Mach. Learn. Commun. Netw. (2024)","DOI":"10.1109\/TMLCN.2024.3352569"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Piotr\u00f3w, M.: UWrMaxSat: efficient solver for MaxSAT and pseudo-boolean problems. In: 32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, 9\u201311 November 2020, pp. 132\u2013136 (2020). https:\/\/doi.org\/10.1109\/ICTAI50040.2020.00031","DOI":"10.1109\/ICTAI50040.2020.00031"},{"key":"5_CR40","doi-asserted-by":"publisher","unstructured":"Rodr\u00edguez-Farr\u00e9s, P., Ballester, R., Ans\u00f3tegui, C., Levy, J., Cerquides, J.: Implementing 3-SAT gadgets for quantum annealers with random instances. In: Computational Science - ICCS 2024 - 24th International Conference, Malaga, Spain, 2\u20134 July 2024, Proceedings, Part VI, pp. 277\u2013291 (2024). https:\/\/doi.org\/10.1007\/978-3-031-63778-0_20","DOI":"10.1007\/978-3-031-63778-0_20"},{"issue":"4","key":"5_CR41","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/4\/045006","volume":"16","author":"S Santra","year":"2014","unstructured":"Santra, S., Quiroz, G., Steeg, G.V., Lidar, D.A.: Max 2-SAT with up to 108 qubits. New J. Phys. 16(4), 045006 (2014). https:\/\/doi.org\/10.1088\/1367-2630\/16\/4\/045006","journal-title":"New J. Phys."},{"issue":"1","key":"5_CR42","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1038\/S43588-021-00184-Y","volume":"2","author":"CD Schuman","year":"2022","unstructured":"Schuman, C.D., Kulkarni, S.R., Parsa, M., Mitchell, J.P., Date, P., Kay, B.: Opportunities for neuromorphic computing algorithms and applications. Nat. Comput. Sci. 2(1), 10\u201319 (2022). https:\/\/doi.org\/10.1038\/S43588-021-00184-Y","journal-title":"Nat. Comput. Sci."},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-030-51825-7_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"F Slivovsky","year":"2020","unstructured":"Slivovsky, F., Szeider, S.: A faster algorithm for propositional model counting parameterized by incidence treewidth. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 267\u2013276. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_19"},{"issue":"6","key":"5_CR44","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1137\/S0097539797328847","volume":"29","author":"L Trevisan","year":"2000","unstructured":"Trevisan, L., Sorkin, G.B., Sudan, M., Williamson, D.P.: Gadgets, approximation, and linear programming. SIAM J. Comput. 29(6), 2074\u20132097 (2000). https:\/\/doi.org\/10.1137\/S0097539797328847","journal-title":"SIAM J. Comput."},{"key":"5_CR45","doi-asserted-by":"publisher","unstructured":"Venkatesh, S.M., Macaluso, A., Nuske, M., Klusch, M., Dengel, A.: Quantum Annealing-Based Algorithm for Efficient Coalition Formation Among LEO Satellites. CoRR abs\/2408.06007 (2024). https:\/\/doi.org\/10.48550\/arXiv.2408.06007","DOI":"10.48550\/arXiv.2408.06007"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Wang, C., Jonckheere, E., Brun, T.: Ollivier-RICCI curvature and fast approximation to treewidth in embeddability of QUBO problems. In: 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP), pp. 598\u2013601. IEEE (2014)","DOI":"10.1109\/ISCCSP.2014.6877946"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-93706-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T17:22:52Z","timestamp":1749316972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93706-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031937057","9783031937064"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93706-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"8 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hampton Roads, VA","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}