{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:48:05Z","timestamp":1778255285997,"version":"3.51.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030193102","type":"print"},{"value":"9783030193119","type":"electronic"}],"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-19311-9_13","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"150-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs"],"prefix":"10.1007","author":[{"given":"Kamil","family":"Khadiev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liliya","family":"Safina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,26]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-98355-4_9","volume-title":"Adventures Between Lower Bounds and Higher Altitudes","author":"F Ablayev","year":"2018","unstructured":"Ablayev, F., Ablayev, M., Khadiev, K., Vasiliev, A.: Classical and quantum computations with restricted memory. In: B\u00f6ckenhauer, H.-J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 129\u2013155. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-98355-4_9"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-73117-9_14","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"F Ablayev","year":"2018","unstructured":"Ablayev, F., Ambainis, A., Khadiev, K., Khadieva, A.: Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 197\u2013211. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-73117-9_14"},{"issue":"6","key":"13_CR3","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1134\/S199508021606007X","volume":"37","author":"F Ablayev","year":"2016","unstructured":"Ablayev, F., Gainutdinova, A., Khadiev, K., Yakary\u0131lmaz, A.: Very narrow quantum OBDDs and width hierarchies for classical OBDDs. Lobachevskii J. Math. 37(6), 670\u2013682 (2016)","journal-title":"Lobachevskii J. Math."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-09704-6_6","volume-title":"Descriptional Complexity of Formal Systems","author":"F Ablayev","year":"2014","unstructured":"Ablayev, F., Gainutdinova, A., Khadiev, K., Yakary\u0131lmaz, A.: Very narrow quantum OBDDs and width hierarchies for classical OBDDs. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 53\u201364. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-09704-6_6"},{"issue":"6","key":"13_CR5","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1515\/DMA.2009.037","volume":"19","author":"F Ablayev","year":"2009","unstructured":"Ablayev, F., Vasilyev, A.: On quantum realisation of boolean functions by the fingerprinting technique. Discrete Math. Appl. 19(6), 555\u2013572 (2009)","journal-title":"Discrete Math. Appl."},{"issue":"20","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1916","DOI":"10.1016\/j.tcs.2009.01.027","volume":"410","author":"A Ambainis","year":"2009","unstructured":"Ambainis, A., Nahimovs, N.: Improved constructions of quantum automata. Theoret. Comput. Sci. 410(20), 1916\u20131922 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR7","unstructured":"Ambainis, A.: A nearly optimal discrete query quantum algorithm for evaluating NAND formulas. arXiv preprint \n                    arXiv:0704.3628\n                    \n                   (2007)"},{"key":"13_CR8","unstructured":"Ambainis, A.: Quantum algorithms for formula evaluation. \n                    https:\/\/arxiv.org\/abs\/1006.3651\n                    \n                   (2010)"},{"key":"13_CR9","unstructured":"Ambainis, A.: Understanding quantum algorithms via query complexity. arXiv preprint \n                    arXiv:1712.06349\n                    \n                   (2017)"},{"issue":"6","key":"13_CR10","doi-asserted-by":"publisher","first-page":"2513","DOI":"10.1137\/080712167","volume":"39","author":"A Ambainis","year":"2010","unstructured":"Ambainis, A., Childs, A.M., Reichardt, B.W., \u0160palek, R., Zhang, S.: Any and-or formula of size N can be evaluated in time \n                    \n                      \n                    \n                    $$N^{1\/2}+o(1)$$\n                   on a quantum computer. SIAM J. Comput. 39(6), 2513\u20132530 (2010)","journal-title":"SIAM J. Comput."},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/11672142_13","volume-title":"STACS 2006","author":"A Ambainis","year":"2006","unstructured":"Ambainis, A., \u0160palek, R.: Quantum algorithms for matching and network flows. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 172\u2013183. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/11672142_13"},{"key":"13_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, New York (2009)"},{"issue":"4\u20135","key":"13_CR13","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschritte der Physik"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math. 305, 53\u201374 (2002)","journal-title":"Contemp. Math."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Bun, M., Kothari, R., Thaler, J.: Quantum algorithms and approximating polynomials for composed functions with shared inputs. arXiv preprint \n                    arXiv:1809.02254\n                    \n                   (2018)","DOI":"10.1137\/1.9781611975482.42"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-33090-2_30","volume-title":"Algorithms \u2013 ESA 2012","author":"AM Childs","year":"2012","unstructured":"Childs, A.M., Kimmel, S., Kothari, R.: The quantum query complexity of read-many formulas. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 337\u2013348. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-33090-2_30"},{"key":"13_CR17","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2001)","edition":"2"},{"key":"13_CR18","unstructured":"De Wolf, R.: Quantum computing and communication complexity (2001)"},{"key":"13_CR19","unstructured":"D\u00f6rn, S.: Quantum complexity of graph and algebraic problems. Ph.D. thesis, Universit\u00e4t Ulm (2008)"},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00224-008-9118-x","volume":"45","author":"S D\u00f6rn","year":"2009","unstructured":"D\u00f6rn, S.: Quantum algorithms for matching problems. Theory Comput. Syst. 45(3), 613\u2013628 (2009)","journal-title":"Theory Comput. Syst."},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-27836-8_42","volume-title":"Automata, Languages and Programming","author":"C D\u00fcrr","year":"2004","unstructured":"D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Mhalla, M.: Quantum query complexity of some graph problems. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 481\u2013493. Springer, Heidelberg (2004). \n                    https:\/\/doi.org\/10.1007\/978-3-540-27836-8_42"},{"issue":"6","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1137\/050644719","volume":"35","author":"C D\u00fcrr","year":"2006","unstructured":"D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Mhalla, M.: Quantum query complexity of some graph problems. SIAM J. Comput. 35(6), 1310\u20131328 (2006)","journal-title":"SIAM J. Comput."},{"key":"13_CR23","unstructured":"Durr, C., H\u00f8yer, P.: A quantum algorithm for finding the minimum. arXiv preprint \n                    arXiv:quant-ph\/9607014\n                    \n                   (1996)"},{"key":"13_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1877-5","volume-title":"Algebraic Logic","author":"SG Gindikin","year":"1985","unstructured":"Gindikin, S.G., Gindikin, S., Gindikin, S.G.: Algebraic Logic. Springer, New York (1985)"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219. ACM (1996)","DOI":"10.1145\/237814.237866"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Grover, L.K., Radhakrishnan, J.: Is partial quantum search of a database any easier? In: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 186\u2013194. ACM (2005)","DOI":"10.1145\/1073970.1073997"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-94631-3_15","volume-title":"Descriptional Complexity of Formal Systems","author":"R Ibrahimov","year":"2018","unstructured":"Ibrahimov, R., Khadiev, K., Pr\u016bsis, K., Yakary\u0131lmaz, A.: Error-free affine, unitary, and probabilistic OBDDs. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 175\u2013187. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-94631-3_15"},{"key":"13_CR28","unstructured":"Jordan, S.: Bounded Error Quantum Algorithms Zoo. \n                    https:\/\/math.nist.gov\/quantum\/zoo"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-58747-9_16","volume-title":"Computer Science \u2013 Theory and Applications","author":"K Khadiev","year":"2017","unstructured":"Khadiev, K., Khadieva, A.: Reordering method and hierarchies for quantum and classical ordered binary decision diagrams. In: Weil, P. (ed.) CSR 2017. LNCS, vol. 10304, pp. 162\u2013175. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-58747-9_16"},{"issue":"9","key":"13_CR30","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1134\/S1995080218090421","volume":"39","author":"K Khadiev","year":"2018","unstructured":"Khadiev, K., Khadieva, A., Mannapov, I.: Quantum online algorithms with respect to space and advice complexity. Lobachevskii J. Math. 39(9), 1210\u20131220 (2018)","journal-title":"Lobachevskii J. Math."},{"issue":"2","key":"13_CR31","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s00224-007-9097-3","volume":"45","author":"F Gall Le","year":"2009","unstructured":"Le Gall, F.: Exponential separation of quantum and classical online space complexity. Theory Comput. Syst. 45(2), 188\u2013202 (2009)","journal-title":"Theory Comput. Syst."},{"key":"13_CR32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, New York (2010)"},{"key":"13_CR33","volume-title":"Introduction to Discrete Mathematics: Textbook for Higher Schools","author":"SV Yablonsky","year":"1989","unstructured":"Yablonsky, S.V.: Introduction to Discrete Mathematics: Textbook for Higher Schools. Mir Publishers, Moscow (1989)"},{"issue":"1","key":"13_CR34","first-page":"9","volume":"34","author":"I Zhegalkin","year":"1927","unstructured":"Zhegalkin, I.: On the technique of calculating propositions in symbolic logic (sur le calcul des propositions dans la logique symbolique). Matematicheskii Sbornik 34(1), 9\u201328 (1927). (in Russian and French)","journal-title":"Matematicheskii Sbornik"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19311-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T03:20:05Z","timestamp":1570764005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19311-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030193102","9783030193119"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19311-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"3 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ucnc2019.uec.ac.jp\/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":"32","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":"19","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":"59% - 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.2","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":"4","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)"}},{"value":"4 abstracts of invited talks and one full paper of an invited talk are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}