{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:31:33Z","timestamp":1743085893239,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030213626"},{"type":"electronic","value":"9783030213633"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21363-3_16","type":"book-chapter","created":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:02:48Z","timestamp":1560726168000},"page":"190-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Precise Complexity of Finding Rainbow Even Matchings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7968-0376","authenticated-orcid":false,"given":"Martin","family":"Loebl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,24]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1090\/conm\/482\/09419","volume":"482","author":"S Bravyi","year":"2009","unstructured":"Bravyi, S.: Contraction of matchgate tensor networks on non-planar graphs. Contemp. Math. 482, 179\u2013211 (2009). Advances in quantum computation","journal-title":"Contemp. Math."},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00220-007-0302-7","volume":"275","author":"D Cimasoni","year":"2007","unstructured":"Cimasoni, D., Reshetikhin, N.: Dimers on surface graphs and spin structures I. Commun. Math. Phys. 275(1), 187\u2013208 (2007)","journal-title":"Commun. Math. Phys."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Curticapean, R., Xia, M.: Parametrizing the permanent: genus, apices, evaluation mod $$2^k$$. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 994\u20131009. IEEE Computer Society (2015)","DOI":"10.1109\/FOCS.2015.65"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Galluccio, A., Loebl, M.: On the theory of Pfaffian orientations II. T-joins, k-cuts, and duality of enumeration. Electron. J. Comb. 6, Article Number R7 (1999)","DOI":"10.37236\/1439"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"5924","DOI":"10.1103\/PhysRevLett.84.5924","volume":"84","author":"A Galluccio","year":"2000","unstructured":"Galluccio, A., Loebl, M., Vondrak, J.: A new algorithm for the Ising problem: partition function for finite lattice graphs. Phys. Rev. Lett. 84, 5924 (2000)","journal-title":"Phys. Rev. Lett."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/PL00011425","volume":"90","author":"A Galluccio","year":"2001","unstructured":"Galluccio, A., Loebl, M., Vondrak, J.: Optimization via enumeration: a new algorithm for the max cut problem. Math. Program. 90, 273\u2013290 (2001)","journal-title":"Math. Program."},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR9","volume-title":"Graph Theory and Theoretical Physics","author":"P Kasteleyn","year":"1967","unstructured":"Kasteleyn, P.: Graph theory and crystal physics. In: Harary, F. (ed.) Graph Theory and Theoretical Physics. Academic Press, London (1967)"},{"key":"16_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-8348-9329-1","volume-title":"Discrete Mathematics in Statistical Physics","author":"M Loebl","year":"2010","unstructured":"Loebl, M.: Discrete Mathematics in Statistical Physics. Vieweg and Teubner, Verlag (2010)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.aim.2010.06.021","volume":"226","author":"M Loebl","year":"2011","unstructured":"Loebl, M., Masbaum, G.: On the optimality of the Arf invariant formula for graph polynomials. Adv. Math. 226, 332\u2013349 (2011)","journal-title":"Adv. Math."},{"issue":"11","key":"16_CR12","doi-asserted-by":"publisher","first-page":"117202","DOI":"10.1103\/PhysRevLett.92.117202","volume":"92","author":"J Lukic","year":"2004","unstructured":"Lukic, J., Galluccio, A., Marinari, E., Martin, O.C., Rinaldi, G.: Critical thermodynamics of the two-dimensional +\/$$-$$J Ising spin glass. Phys. Rev. Lett. 92(11), 117202 (2004)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105\u2013113 (1987)","journal-title":"Combinatorica"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Schaefer, J.: The complexity of satisfiability problems. In: 10th Annual ACM Symposium on Theory of Computing, STOC 1978, Proceedings, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1006\/jctb.1999.1941","volume":"78","author":"G Tesler","year":"2000","unstructured":"Tesler, G.: Matchings in graphs on non-orientable surfaces. J. Comb. Theory Ser. B 78, 198\u2013231 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"key":"16_CR16","unstructured":"Valiant, L.: Holographic algorithms (extended abstract). In: 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004. IEEE Computer Society (2004)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21363-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:36:21Z","timestamp":1709818581000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21363-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030213626","9783030213633"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21363-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algebraic Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ni\u0161","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.pmf.ni.ac.rs\/CAI2019\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","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":"20","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":"57% - 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.1","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":"1.76","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}