{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:10:10Z","timestamp":1746252610680,"version":"3.40.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_19","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T05:30:40Z","timestamp":1401687040000},"page":"245-258","source":"Crossref","is-referenced-by-count":0,"title":["Processing Succinct Matrices and Vectors"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[]},{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","volume":"107","author":"C. \u00c0lvarez","year":"1993","unstructured":"\u00c0lvarez, C., Jenner, B.: A very hard log-space counting class. Theor. Comput. Sci.\u00a0107, 3\u201330 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s00037-007-0222-0","volume":"16","author":"M. Beaudry","year":"2007","unstructured":"Beaudry, M., Holzer, M.: The complexity of tensor circuit evaluation. Computational Complexity\u00a016(1), 60\u2013111 (2007)","journal-title":"Computational Complexity"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1006\/jcss.2002.1852","volume":"65","author":"P. Berman","year":"2002","unstructured":"Berman, P., Karpinski, M., Larmore, L.L., Plandowski, W., Rytter, W.: On the complexity of pattern matching for highly compressed two-dimensional texts. J. Comput. Syst. Sci.\u00a065, 332\u2013350 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR4","series-title":"IFIP","first-page":"87","volume-title":"TCS 2008","author":"A. Bertoni","year":"2008","unstructured":"Bertoni, A., Choffrut, C., Radicioni, R.: Literal shuffle of compressed words. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) TCS 2008. IFIP, vol.\u00a0273, pp. 87\u2013100. Springer, Heidelberg (2008)"},{"issue":"8","key":"19_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1006\/jcss.1998.1588","volume":"57","author":"H. Caussinus","year":"1998","unstructured":"Caussinus, H., McKenzie, P., Th\u00e9rien, D., Vollmer, H.: Nondeterministic NC1 computation. Journal of Computer and System Sciences\u00a057(2), 200\u2013212 (1998)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/s00037-000-0170-4","volume":"11","author":"C. Damm","year":"2002","unstructured":"Damm, C., Holzer, M., McKenzie, P.: The complexity of tensor calculus. Computational Complexity\u00a011(1-2), 54\u201389 (2002)","journal-title":"Computational Complexity"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1142\/S0218195908002568","volume":"18","author":"D. Eppstein","year":"2008","unstructured":"Eppstein, D., Goodrich, M.T., Sun, J.Z.: Skip quadtrees: Dynamic data structures for multidimensional point sets. Int. J. Comput. Geometry Appl.\u00a018, 131\u2013160 (2008)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Kannan, S., Vardi, M.Y., Viswanathan, M.: The complexity of problems on graphs represented as obdds. Chicago J. Theor. Comput. Sci. (1999)","DOI":"10.1007\/BFb0028563"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Fujii, H., Ootomo, G., Hori, C.: Interleaving based variable ordering methods for ordered binary decision diagrams. In: Proc. ICCAD 1993, pp. 38\u201341. IEEE Computer Society (1993)","DOI":"10.1109\/ICCAD.1993.580028"},{"issue":"2\/3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008647823331","volume":"10","author":"M. Fujita","year":"1997","unstructured":"Fujita, M., McGeer, P.C., Yang, J.C.-Y.: Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. Formal Methods in System Design\u00a010(2\/3), 149\u2013169 (1997)","journal-title":"Formal Methods in System Design"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.ic.2005.02.002","volume":"198","author":"M. Galota","year":"2005","unstructured":"Galota, M., Vollmer, H.: Functions computable in polynomial space. Inf. Comput.\u00a0198(1), 56\u201370 (2005)","journal-title":"Inf. Comput."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","volume":"56","author":"H. Galperin","year":"1983","unstructured":"Galperin, H., Wigderson, A.: Succinct representations of graphs. Inform. and Control\u00a056, 183\u2013198 (1983)","journal-title":"Inform. and Control"},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.jco.2012.10.001","volume":"29","author":"B. Grenet","year":"2013","unstructured":"Grenet, B., Koiran, P., Portier, N.: On the complexity of the multivariate resultant. J. Complexity\u00a029(2), 142\u2013157 (2013)","journal-title":"J. Complexity"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1137\/0218073","volume":"18","author":"R.E. Ladner","year":"1989","unstructured":"Ladner, R.E.: Polynomial space counting problems. SIAM J. Comput.\u00a018, 1087\u20131097 (1989)","journal-title":"SIAM J. Comput."},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. Lenstra","year":"1983","unstructured":"Lenstra, H.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1016\/j.ic.2011.01.009","volume":"209","author":"M. Lohrey","year":"2011","unstructured":"Lohrey, M.: Leaf languages and string compression. Inf. Comput.\u00a0209, 951\u2013965 (2011)","journal-title":"Inf. Comput."},{"key":"19_CR18","first-page":"241","volume":"4","author":"M. Lohrey","year":"2012","unstructured":"Lohrey, M.: Algorithmics on SLP-compressed strings: a survey. Groups Complex.\u00a0Cryptol.\u00a04, 241\u2013299 (2012)","journal-title":"Groups Complex.\u00a0Cryptol."},{"key":"19_CR19","unstructured":"Lohrey, M., Schmidt-Schau\u00df, M.: Processing Succinct Matrices and Vectors. arXiv (2014), http:\/\/arxiv.org\/abs\/1402.3452"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-22953-4_18","volume-title":"Fundamentals of Computation Theory","author":"G. Malod","year":"2011","unstructured":"Malod, G.: Succinct algebraic branching programs characterizing non-uniform complexity classes. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol.\u00a06914, pp. 205\u2013216. Springer, Heidelberg (2011)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Meinel, C., Theobald, T.: Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications. Springer (1998)","DOI":"10.1007\/978-3-642-58940-9"},{"issue":"1","key":"19_CR22","first-page":"39","volume":"34","author":"C. Mereghetti","year":"2000","unstructured":"Mereghetti, C., Palano, B.: Threshold circuits for iterated matrix product and powering. ITA\u00a034(1), 39\u201346 (2000)","journal-title":"ITA"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms - ESA \u201994","author":"W. Plandowski","year":"1994","unstructured":"Plandowski, W.: Testing equivalence of morphisms in context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 460\u2013470. Springer, Heidelberg (1994)"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1990)","DOI":"10.1007\/3-540-52208-5_28"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-68530-8_12","volume-title":"Algorithms - ESA \u201998","author":"A. Storjohann","year":"1998","unstructured":"Storjohann, A., Mulders, T.: Fast algorithms for linear algebra modulo N. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 139\u2013150. Springer, Heidelberg (1998)"},{"key":"19_CR26","unstructured":"Ta\u012dclin, M.A.: Algorithmic problems for commutative semigroups. Dokl. Akda. Nauk SSSR 9(1), 201\u2013204 (1968)"},{"key":"19_CR27","unstructured":"Toda, S.: Counting problems computationally equivalent to computing the determinant. Technical Report CSIM 91-07, Tokyo University of Electro-Communications (1991)"},{"key":"19_CR28","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S. Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput.\u00a020, 865\u2013877 (1991)","journal-title":"SIAM J. Comput."},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Completeness classes in algebra. In: Proc.\u00a0STOC 1979, pp. 249\u2013261. ACM (1979)","DOI":"10.1145\/800135.804419"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Veith, H.: How to encode a logical structure by an OBDD. In: Proc. 13th Annual IEEE Conference on Computational Complexity, pp. 122\u2013131. IEEE Computer Society (1998)","DOI":"10.1109\/CCC.1998.694598"},{"issue":"11","key":"19_CR31","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1109\/12.324559","volume":"43","author":"I. Wegener","year":"1994","unstructured":"Wegener, I.: The size of reduced OBDD\u2019s and optimal read-once branching programs for almost all boolean functions. IEEE Trans. Computers\u00a043(11), 1262\u20131269 (1994)","journal-title":"IEEE Trans. Computers"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:49:04Z","timestamp":1746251344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}