{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:39:07Z","timestamp":1743111547154,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108007"},{"type":"electronic","value":"9783030108014"}],"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-10801-4_10","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"108-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5357-1304","authenticated-orcid":false,"given":"Milo\u0161","family":"Chrom\u00fd","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7512-6260","authenticated-orcid":false,"given":"Petr","family":"Ku\u010dera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"key":"10_CR1","unstructured":"Metacentrum grid computing, June 2017. https:\/\/metavo.metacentrum.cz\/en\/"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/0097-3165(86)90060-9","volume":"43","author":"R Aharoni","year":"1986","unstructured":"Aharoni, R., Linial, N.: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Comb. Theory Ser. A 43(2), 196\u2013204 (1986). https:\/\/doi.org\/10.1016\/0097-3165(86)90060-9. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0097316586900609","journal-title":"J. Comb. Theory Ser. A"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Audemard, G., Simon, L.: The glucose sat solver, June 2017. http:\/\/www.labri.fr\/perso\/lsimon\/glucose\/","DOI":"10.1142\/S0218213018400018"},{"key":"10_CR4","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. GTM, vol. 184. Springer, New York (1998). https:\/\/doi.org\/10.1007\/978-1-4612-0619-4"},{"key":"10_CR5","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, IJCAI 1991, vol. 1, pp. 331\u2013337. Morgan Kaufmann Publishers Inc., San Francisco (1991). http:\/\/dl.acm.org\/citation.cfm?id=1631171.1631221"},{"key":"10_CR6","unstructured":"Chrom\u00fd, M., Ku\u010dera, P.: Phase transition in matched formulas and a heuristic for biclique satisfiability. ArXiv e-prints, August 2018. https:\/\/arxiv.org\/abs\/1808.01774"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1137\/090777268","volume":"26","author":"Harold Connamacher","year":"2012","unstructured":"Connamacher, H.S., Molloy, M.: The satisfiability threshold for a seemingly intractable random constraint satisfaction problem. CoRR abs\/1202.0042 (2012). http:\/\/arxiv.org\/abs\/1202.0042","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151\u2013158. ACM, New York (1971). https:\/\/doi.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047"},{"key":"10_CR9","unstructured":"Dubois, O., Boufkhad, Y., Mandler, J.: Typical random 3-SAT formulae and the satisfiability threshold. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 126\u2013127. Society for Industrial and Applied Mathematics, Philadelphia (2000). http:\/\/dl.acm.org\/citation.cfm?id=338219.338243"},{"key":"10_CR10","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: The minisat, June 2017. http:\/\/minisat.se\/"},{"issue":"2\u20133","key":"10_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0166-218X(01)00358-4","volume":"125","author":"J Franco","year":"2003","unstructured":"Franco, J., Van Gelder, A.: A perspective on certain polynomial-time solvable classes of satisfiability. Discrete Appl. Math. 125(2\u20133), 177\u2013214 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(01)00358-4. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X01003584","journal-title":"Discrete Appl. Math."},{"key":"10_CR12","unstructured":"Gent, I.P., Walsh, T.: The SAT phase transition. In: Proceedings of the 11th European Conference on Artificial Intelligence, pp. 105\u2013109. Wiley (1994)"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Heydari, M.H., Morales, L., Shields Jr., C.O., Sudborough, I.H.: Computing cross associations for attack graphs and other applications. In: 2007 40th Annual Hawaii International Conference on System Sciences, HICSS 2007, p. 270b, January 2007. https:\/\/doi.org\/10.1109\/HICSS.2007.141","DOI":"10.1109\/HICSS.2007.141"},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"10_CR15","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. North-Holland, Amsterdam (1986)"},{"key":"10_CR16","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: Proceedings of the 10th National Conference on Artificial Intelligence (AAAI 1992), San Jose, CA, USA, pp. 459\u2013465 (1992)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10472-005-0432-6","volume":"43","author":"S Szeider","year":"2005","unstructured":"Szeider, S.: Generalizations of matched CNF formulas. Ann. Math. Artif. Intell. 43(1), 223\u2013238 (2005). https:\/\/doi.org\/10.1007\/s10472-005-0432-6","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8(1), 85\u201389 (1984). https:\/\/doi.org\/10.1016\/0166-218X(84)90081-7. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0166218X84900817","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:16:14Z","timestamp":1709810174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_10","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":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"27 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","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":"92","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":"35","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":"6","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":"38% - 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","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":"3.3","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)"}}]}}