{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:55Z","timestamp":1725662875666},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108283"},{"type":"electronic","value":"9783540387169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10828-9_71","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:25:53Z","timestamp":1330172753000},"page":"308-315","source":"Crossref","is-referenced-by-count":0,"title":["A # P-complete problem over arithmetical trees"],"prefix":"10.1007","author":[{"given":"Giancarlo","family":"Mauri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicoletta","family":"Sabadini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"21_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Ullman, J.E., Hopcroft, J.D., The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Mass., 1974"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bertoni,A., Mauri,G., Sabadini,N., A characterization of the class of functions computable in polynomial time on RAM's, Proc. ACM STOC 81, to appear, 1981","DOI":"10.1145\/800076.802470"},{"key":"21_CR3","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S., Computers and Intractability, W.H. Freeman and Co., San Francisco, 1979"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Hartmanis,J., Simon,J., On the power of multiplication in Random Access Machines, IEEE Conf. Rec. 15th Symp. on Switching Automata Theory, 1974, 13\u201323","DOI":"10.1109\/SWAT.1974.20"},{"key":"21_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6404-0","volume-title":"Combinatorial Methods","author":"J.K. Percus","year":"1971","unstructured":"Percus, J.K., Combinatorial Methods, Springer, Berlin, 1971"},{"key":"21_CR6","volume-title":"An introduction to combinatorial analysis","author":"J. Riordan","year":"1958","unstructured":"Riordan, J., An introduction to combinatorial analysis, Wiley, New York, 1958"},{"key":"21_CR7","series-title":"Lect. Not. in Comp. Sci.","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/3-540-09510-1_42","volume-title":"On the power of Random Access Machines, Proc. 6th ICALP","author":"A. Sch\u00f6nhage","year":"1979","unstructured":"Sch\u00f6nhage, A., On the power of Random Access Machines, Proc. 6th ICALP, Lect. Not. in Comp. Sci. 71, Springer, Berlin, 1979, 520\u2013529"},{"key":"21_CR8","series-title":"Lect. Not. in Comp. Sci.","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-08342-1_37","volume-title":"On the difference between the one and the many","author":"J. Simon","year":"1977","unstructured":"Simon, J., On the difference between the one and the many, in Lect. Not. in Comp. Sci. 52, Springer, Berlin, 1977, 480\u2013491"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Simon,J., Division is good, Comp. Sci. Dept., Pennsylvania State University, 1979","DOI":"10.1109\/SFCS.1979.13"},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G., The complexity of computing the permanent, Theoretical Computer Science 8, 1979, 189\u2013202","journal-title":"Theoretical Computer Science"},{"key":"21_CR11","unstructured":"Valiant,L.G., The complexity of enumeration and reliability problems, Res. Rep. CSR-15 77, Dept. of Comp. Sci., Univ. of Edinburgh, 1977"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Valiant,L.G., Completeness classes in algebra, 11th ACM STOC, 1979, 249\u2013261","DOI":"10.1145\/800135.804419"}],"container-title":["Lecture Notes in Computer Science","CAAP '81"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10828-9_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:03:31Z","timestamp":1605625411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10828-9_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108283","9783540387169"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-10828-9_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}