{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:15Z","timestamp":1758586215138,"version":"3.44.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_23","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:47Z","timestamp":1758498347000},"page":"309-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partially Ordered Sets Corresponding to the Partition Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1780-9677","authenticated-orcid":false,"given":"Susumu","family":"Kubo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1155\/JAMDS.2005.113","volume":"2","author":"B Alidaee","year":"2005","unstructured":"Alidaee, B., Glover, F., Kochenberger, G.A., Rego, C.: A new modeling and solution approach for the number partitioning problem. J. Appl. Math. Decis. Sci. 2, 113\u2013121 (2005). https:\/\/doi.org\/10.1155\/JAMDS.2005.113","journal-title":"J. Appl. Math. Decis. Sci."},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Borgs, C., Chayes, J., Pittel, B.: Phase transition and finete-size scaling for the integer partitioning problem. Random Struct. Algorithms 19, 247\u2013288 (2001). https:\/\/doi.org\/10.1002\/rsa.10004","DOI":"10.1002\/rsa.10004"},{"key":"23_CR3","volume-title":"Probabilistic Analysis of Packing and Partitioning Algorithms","author":"EG Coffman Jr","year":"1991","unstructured":"Coffman, E.G., Jr., Lueker, G.S.: Probabilistic Analysis of Packing and Partitioning Algorithms. Wiley, Chichester (1991)"},{"key":"23_CR4","doi-asserted-by":"publisher","unstructured":"Fuksz, L., Pop, P.C.: A hybrid genetic algorithm with variable neighborhood search approach to the number partitioning problem. In: Pan, J.S., Polycarpou, M.M., Wo\u017aniak, M., de\u00a0Carvalho, A.C.P.L.F., Quinti\u00e1n, H., Corchado, E. (eds.) 8th International Conference on Hybrid Artificial Intelligence Systems, pp. 649\u2013658 (2013). https:\/\/doi.org\/10.1007\/978-3-642-40846-5_65","DOI":"10.1007\/978-3-642-40846-5_65"},{"key":"23_CR5","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York (1979)"},{"key":"23_CR6","first-page":"170","volume-title":"ECAI 96: 12th European Conference on Artificial Intelligence","author":"IP Gent","year":"1996","unstructured":"Gent, I.P., Walsh, T.: Phase transitions and annealed theories: number partitioning as a case study. In: Wahlster, W. (ed.) ECAI 96: 12th European Conference on Artificial Intelligence, pp. 170\u2013174. Wiley, Chichester (1996)"},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Hartmann, A.K., Mann, A., Radenbach, W.: Solution-space structure of (some) optimization problems. J. Phys. Conf. Ser. 95, 012011 (2008). https:\/\/doi.org\/10.1088\/1742-6596\/95\/1\/012011","DOI":"10.1088\/1742-6596\/95\/1\/012011"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E Horowitz","year":"1974","unstructured":"Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack problem. J. ACM 21, 277\u2013292 (1974). https:\/\/doi.org\/10.1145\/321812.321823","journal-title":"J. ACM"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"DS Johnson","year":"1991","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Oper. Res. 39, 378\u2013406 (1991). https:\/\/doi.org\/10.1287\/opre.39.3.378","journal-title":"Oper. Res."},{"key":"23_CR10","unstructured":"Karmarkar, N., Karp, R.M.: The differencing method of set partitioning. Technical Report, Computer Science Division, University of California, Berkeley 82\/113 (1982). http:\/\/www2.eecs.berkeley.edu\/Pubs\/TechRpts\/1983\/6353.html"},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Korf, R.E.: A complete anytime algorithm for number partitioning. Artif. Intell. 106, 181\u2013203 (1998). https:\/\/doi.org\/10.1016\/S0004-3702(98)00086-1, https:\/\/doi.org\/10.1016\/S0004-3702(98)00086-1","DOI":"10.1016\/S0004-3702(98)00086-1"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Kubo, S., Nishinari, K.: An algebraic expression of the number partitioning problem. Discrete Appl. Math. 285, 283\u2013296 (2020). https:\/\/doi.org\/10.1016\/j.dam.2020.04.020","DOI":"10.1016\/j.dam.2020.04.020"},{"key":"23_CR14","unstructured":"Lindstr\u00f6m: Conjecture on a theorem similar to Sperner\u2019s. In: Guy, R., Hanani, H., Sauer, N., Sch\u00f6nheim, J. (eds.) Combinatorial Structures and Their Applications, p.\u00a0241. Gordon and Breach, New York (1970)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"4281","DOI":"10.1103\/PhysRevLett.81.4281","volume":"81","author":"S Mertens","year":"1998","unstructured":"Mertens, S.: Phase transition in the number partitioning problem. Phys. Rev. Lett. 81, 4281\u20134284 (1998). https:\/\/doi.org\/10.1103\/PhysRevLett.81.4281","journal-title":"Phys. Rev. Lett."},{"key":"23_CR16","doi-asserted-by":"publisher","unstructured":"Ruml, W., Ngo, J.T., Marks, J., Shieber, S.M.: Easily searched encodings for number partitioning. J. Optim. Theory Appl. 89, 251\u2013291 (1996). https:\/\/doi.org\/10.1007\/BF02192530","DOI":"10.1007\/BF02192530"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/0210033","volume":"10","author":"R Schroeppels","year":"1981","unstructured":"Schroeppels, R., Shamir, A.: A $${T}= {O}(2^{n\/2})$$, $${S}={O}(2^{n\/4})$$ algorithm for certain NP-complete problems. SIAM J. Comput. 10, 456\u2013464 (1981). https:\/\/doi.org\/10.1137\/0210033","journal-title":"SIAM J. Comput."},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Stanley, R.P.: Weyl groups, the hard Lefschetz theorem, and the Sperner property. SIAM J. Algebraic Discrete Methods 1, 168\u2013184 (1980). https:\/\/doi.org\/10.1137\/0601021","DOI":"10.1137\/0601021"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0166-218X(91)90089-F","volume":"34","author":"RP Stanley","year":"1991","unstructured":"Stanley, R.P.: Some applications of algebra to combinatorics. Discret. Appl. Math. 34, 241\u2013277 (1991). https:\/\/doi.org\/10.1016\/0166-218X(91)90089-F","journal-title":"Discret. Appl. Math."},{"key":"23_CR20","unstructured":"Sullivan, B.D.: On a conjecture of Andrica and Tomescu. J. Integer Sequences 16, Article 13.3.1 (2013)"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1137\/0221007","volume":"21","author":"LH Tsai","year":"1992","unstructured":"Tsai, L.H.: Asymptotic analysis of an algorithm for balanced processor scheduling. SIAM J. Comput. 21, 59\u201364 (1992). https:\/\/doi.org\/10.1137\/0221007","journal-title":"SIAM J. Comput."},{"key":"23_CR22","unstructured":"Wilson, D.W.: Sequence A025591. The On-Line Encyclopedia of Integer Sequences (2023). https:\/\/oeis.org\/A025591"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:48Z","timestamp":1758498348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}