{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:52:16Z","timestamp":1742946736358,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171418"},{"type":"electronic","value":"9783319171425"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17142-5_26","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T11:19:29Z","timestamp":1429096769000},"page":"297-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bounded Treewidth and Space-Efficient Linear Algebra"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Balaji","sequence":"first","affiliation":[]},{"given":"Samir","family":"Datta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s000370050023","volume":"8","author":"E Allender","year":"1999","unstructured":"Allender, E., Beals, R., Ogihara, M.: The complexity of matrix rank and feasible systems of linear equations. Comput. Complex. 8(2), 99\u2013126 (1999)","journal-title":"Comput. Complex."},{"key":"26_CR2","series-title":"Modern Birkh\u00e4user Classics","first-page":"149","volume-title":"Classic Papers in Combinatorics","author":"T Aardenne-Ehrenfest","year":"1987","unstructured":"Aardenne-Ehrenfest, T., Bruijn, N.G.: Circuits and trees in oriented linear graphs. In: Gessel, I., Rota, G.-C. (eds.) Classic Papers in Combinatorics. Modern Birkh\u00e4user Classics, pp. 149\u2013163. Birkh\u00e4user, Boston (1987)"},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"SJ Berkowitz","year":"1984","unstructured":"Berkowitz, S.J.: On computing the determinant in small parallel time using a small number of processors. Inf. Process. Lett. 18(3), 147\u2013150 (1984)","journal-title":"Inf. Process. Lett."},{"key":"26_CR4","unstructured":"Brightwell, G., Winkler, P.: Counting eulerian circuits is# p-complete. In: ALENEX\/ANALCO, pp. 259\u2013262. Citeseer (2005)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.jda.2011.03.011","volume":"10","author":"P Chebolu","year":"2012","unstructured":"Chebolu, P., Cryan, M., Martin, R.: Exact counting of euler tours for generalized series-parallel graphs. J. Discrete Algorithms 10, 110\u2013122 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"26_CR6","unstructured":"Chebolu, P., Cryan, M., Martin, R.: Exact counting of euler tours for graphs of bounded treewidth. In: CoRR, abs\/1310.0185 (2013)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y., Flum, J.: On the ordered conjecture. In: Proceedings of the 2012 27th Annual IEEE\/ACM Symposium on Logic in Computer Science, pp. 225\u2013234. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.33"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. comput."},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s00224-013-9469-9","volume":"53","author":"B Das","year":"2013","unstructured":"Das, B., Datta, S., Nimbhorkar, P.: Log-space algorithms for paths and matchings in k-trees. Theor. Comput. Syst. 53(4), 669\u2013689 (2013)","journal-title":"Theor. Comput. Syst."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Datta, S., Kulkarni, R., Limaye, N., Mahajan, M.: Planarity, determinants, permanents, and (unique) matchings. TOCT 1(3) (2010)","DOI":"10.1145\/1714450.1714453"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Jakoby, A., Tantau, T.: Logspace versions of the theorems of bodlaender and courcelle. In: FOCS, pp. 143\u2013152 (2010)","DOI":"10.1109\/FOCS.2010.21"},{"issue":"3","key":"26_CR12","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jcss.1997.1485","volume":"54","author":"K Etessami","year":"1997","unstructured":"Etessami, K.: Counting quantifiers, successor relations, and logarithmic space. J. Comput. Syst. Sci. 54(3), 400\u2013411 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR13","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory, vol. 3. Springer, Heidelberg (2006)"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Barrington, D.A.M.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci. 65, 695\u2013716 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley, K.: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica 7(1), 101\u2013104 (1987)","journal-title":"Combinatorica"},{"key":"26_CR16","first-page":"26","volume":"1997","author":"M Mahajan","year":"1997","unstructured":"Mahajan, M., Vinay, V.: Determinant: combinatorics, algorithms, and complexity. Chicago J. Theor. Comput. Sci. 1997, 26 (1997)","journal-title":"Chicago J. Theor. Comput. Sci."},{"key":"26_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6998-8","volume-title":"Algebraic Combinatorics","author":"RP Stanley","year":"2013","unstructured":"Stanley, R.P.: Algebraic Combinatorics. Springer-Verlag, New York (2013)"},{"key":"26_CR18","unstructured":"Toda, S.: Counting problems computationally equivalent to the determinant. Technical report CSIM 91\u201307, Dept of Comp Sc & Information Mathematics, Univ of Electro-Communications, Chofu-shi, Tokyo (1991)"},{"issue":"4","key":"26_CR19","doi-asserted-by":"publisher","first-page":"233","DOI":"10.2307\/2302716","volume":"48","author":"WT Tutte","year":"1941","unstructured":"Tutte, W.T., Smith, C.A.B.: On unicursal paths in a network of degree 4. Am. Math. Monthly 48(4), 233\u2013237 (1941)","journal-title":"Am. Math. Monthly"},{"key":"26_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra (3. ed.)","author":"J von zur Gathen","year":"2013","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra (3. ed.). Cambridge University Press, New York (2013)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17142-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T14:46:46Z","timestamp":1675262806000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17142-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171418","9783319171425"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17142-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}