{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:15:13Z","timestamp":1743095713634,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"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-19955-5_14","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"156-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Matched Instances of Quantum Satisfiability (QSat) \u2013 Product State Solutions of Restrictions"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Goerdt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Aldi, M., de Beaudrap, N., Gharibian, S., Saeedi, S.: On efficiently solvable cases of quantum k-SAT. In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, 27\u201331 August, Liverpool, UK. pp. 38:1\u201338:16 (2018), https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.38","key":"14_CR1","DOI":"10.4230\/LIPIcs.MFCS.2018.38"},{"doi-asserted-by":"publisher","unstructured":"Arad, I., Santha, M., Sundaram, A., Zhang, S.: Linear time algorithm for quantum 2SAT. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, 11\u201315 July, Rome, Italy, pp. 15:1\u201315:14 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.15","key":"14_CR2","DOI":"10.4230\/LIPIcs.ICALP.2016.15"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90002-4","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"publisher","unstructured":"de Beaudrap, J.N., Gharibian, S.: A linear time algorithm for quantum 2-SAT. In: 31st Conference on Computational Complexity, CCC 2016, 29 May\u20131 June, Tokyo, Japan, pp. 27:1\u201327:21 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2016.27","key":"14_CR4","DOI":"10.4230\/LIPIcs.CCC.2016.27"},{"doi-asserted-by":"crossref","unstructured":"Bravyi, S.: Efficient algorithm for a quantum analogue of 2-SAT. In: Cross Disciplinary Advances in Quantum Computing, University of Tyer, Texas, 1\u20134 October, pp. 33\u201348 (2009). https:\/\/arxiv.org\/abs\/quant-ph\/0602108","key":"14_CR5","DOI":"10.1090\/conm\/536\/10552"},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691\u2013703 (1976). https:\/\/doi.org\/10.1137\/0205048","journal-title":"SIAM J. Comput."},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1561\/0400000066","volume":"10","author":"S Gharibian","year":"2015","unstructured":"Gharibian, S., Huang, Y., Landau, Z., Shin, S.W.: Quantum hamiltonian complexity. Found. Trends Theor. Comput. Sci. 10(3), 159\u2013282 (2015). https:\/\/doi.org\/10.1561\/0400000066","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-24749-4_28","volume-title":"STACS 2004","author":"J Johannsen","year":"2004","unstructured":"Johannsen, J.: Satisfiability problems complete for deterministic logarithmic space. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 317\u2013325. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24749-4_28"},{"unstructured":"Kullmann, O., Zhao, X.: Bounds for variables with few occurrences in conjunctive normal forms. CoRR abs\/1408.0629 (2014). http:\/\/arxiv.org\/abs\/1408.0629","key":"14_CR9"},{"unstructured":"Laumann, C.R., L\u00e4uchli, A.M., Scardicchio, A., Sondhi, S.L.: On product, generic and random generic quantum satisfiability. CoRR abs\/0910.2058 (2009). http:\/\/arxiv.org\/abs\/0910.2058","key":"14_CR10"},{"unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)","key":"14_CR11"},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02829441","volume":"114","author":"K. R. Parthasarathy","year":"2004","unstructured":"Parthasarathy, K.R.: On the maximal dimension of completely entangled subspace for finite level quantum systems. Proc. Indian Acad. Sci. (Math. Sci.) 114, 364\u2013375 (2004). https:\/\/arxiv.org\/abs\/quant-ph\/0405077","journal-title":"Proceedings Mathematical Sciences"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1093\/qmath\/25.1.303","volume":"25","author":"PD Seymour","year":"1974","unstructured":"Seymour, P.D.: On the two-colouring of hypergraphs. Q. J. Math. 25, 303\u2013312 (1974)","journal-title":"Q. J. Math."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:02:00Z","timestamp":1710349320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_14","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":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","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":"71","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":"31","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":"44% - 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":"2.27","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)"}}]}}