{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:00:05Z","timestamp":1780743605561,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642144547","type":"print"},{"value":"9783642144554","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14455-4_31","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T15:06:02Z","timestamp":1281711962000},"page":"340-351","source":"Crossref","is-referenced-by-count":11,"title":["Fast Parsing for Boolean Grammars: A Generalization of Valiant\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF00264600","volume":"11","author":"L. Adleman","year":"1978","unstructured":"Adleman, L., Booth, K.S., Preparata, F.P., Ruzzo, W.L.: Improved time and space bounds for Boolean matrix multiplication. Acta Informatica\u00a011(1), 61\u201370 (1978)","journal-title":"Acta Informatica"},{"key":"31_CR2","first-page":"1209","volume":"11","author":"V.L. Arlazarov","year":"1970","unstructured":"Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzhev, I.A.: On economical construction of the transitive closure of an oriented graph. Soviet Mathematics Doklady\u00a011, 1209\u20131210 (1970)","journal-title":"Soviet Mathematics Doklady"},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09(3), 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"issue":"6","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1142\/S0129054107005248","volume":"18","author":"Z. \u00c9sik","year":"2007","unstructured":"\u00c9sik, Z., Kuich, W.: Boolean fuzzy sets. International Journal of Foundations of Computer Science\u00a018(6), 1197\u20131207 (2007)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"9","key":"31_CR5","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.ic.2009.05.002","volume":"207","author":"V. Kountouriotis","year":"2009","unstructured":"Kountouriotis, V., Nomikos, C., Rondogiannis, P.: Well-founded semantics for Boolean grammars. Information and Computation\u00a0207(9), 945\u2013967 (2009)","journal-title":"Information and Computation"},{"issue":"4","key":"31_CR6","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics\u00a06(4), 519\u2013535 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ic.2004.03.006","volume":"194","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: Boolean grammars. Information and Computation\u00a0194(1), 19\u201348 (2004)","journal-title":"Information and Computation"},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1142\/S0129054106004029","volume":"17","author":"A. Okhotin","year":"2006","unstructured":"Okhotin, A.: Generalized LR parsing algorithm for Boolean grammars. International Journal of Foundations of Computer Science\u00a017(3), 629\u2013664 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3-4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00236-007-0045-0","volume":"44","author":"A. Okhotin","year":"2007","unstructured":"Okhotin, A.: Recursive descent parsing for Boolean grammars. Acta Informatica\u00a044(3-4), 167\u2013189 (2007)","journal-title":"Acta Informatica"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1016\/j.ic.2008.03.023","volume":"206","author":"A. Okhotin","year":"2008","unstructured":"Okhotin, A.: Unambiguous Boolean grammars. Information and Computation\u00a0206, 1234\u20131247 (2008)","journal-title":"Information and Computation"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik\u00a013, 354\u2013356 (1969)","journal-title":"Numerische Mathematik"},{"issue":"2","key":"31_CR12","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(75)80046-8","volume":"10","author":"L.G. Valiant","year":"1975","unstructured":"Valiant, L.G.: General context-free recognition in less than cubic time. Journal of Computer and System Sciences\u00a010(2), 308\u2013314 (1975)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14455-4_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:53:01Z","timestamp":1606186381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14455-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144547","9783642144554"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14455-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}