{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:24Z","timestamp":1725490224214},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745099"},{"type":"electronic","value":"9783540745105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74510-5_15","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T15:11:35Z","timestamp":1187709095000},"page":"127-138","source":"Crossref","is-referenced-by-count":3,"title":["Equivalence Problems for Circuits over Sets of Natural Numbers"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[]},{"given":"Katrin","family":"Herr","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Reitwie\u00dfner","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Travers","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Waldherr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/270563.270564","volume":"28","author":"E. Allender","year":"1997","unstructured":"Allender, E.: Making computation count: Arithmetic circuits in the nineties. SIGACT NEWS\u00a028(4), 2\u201315 (1997)","journal-title":"SIGACT NEWS"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Breunig, H.: The complexity of membership problems for circuits over sets of positive numbers. In: Proceedings 16th International Symposium on Fundamentals of Computation Theory. LNCS, Springer, Heidelberg (to appear, 2007)","DOI":"10.1007\/978-3-540-74240-1_12"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(82)90139-9","volume":"14","author":"K. Ko","year":"1982","unstructured":"Ko, K.: Some observations on the probabilistic algorithms and NP-hard problems. Information Processing Letters\u00a014(1), 39\u201343 (1982)","journal-title":"Information Processing Letters"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/SWAT.1972.29","volume-title":"Proceedings 13th Symposium on Switching and Automata Theory","author":"A.R. Meyer","year":"1972","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential time. In: Proceedings 13th Symposium on Switching and Automata Theory, pp. 125\u2013129. IEEE Computer Society Press, Los Alamitos (1972)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/3-540-36494-3_50","volume-title":"STACS 2003","author":"P. McKenzie","year":"2003","unstructured":"McKenzie, P., Wagner, K.W.: The complexity of membership problems for circuits over sets of natural numbers. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 571\u2013582. Springer, Heidelberg (2003)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A.: On the power of random access machines. In: ICALP, pp. 520\u2013529 (1979)","DOI":"10.1007\/3-540-09510-1_42"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/800125.804029","volume-title":"Proceedings 5th ACM Symposium on the Theory of Computing","author":"L.J. Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proceedings 5th ACM Symposium on the Theory of Computing, pp. 1\u20139. ACM Press, New York (1973)"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"I.H. Sudborough","year":"1978","unstructured":"Sudborough, I.H.: On the tape complexity of deterministic context-free languages. Journal of the ACM\u00a025(3), 405\u2013414 (1978)","journal-title":"Journal of the ACM"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.tcs.2006.08.017","volume":"369","author":"S. Travers","year":"2006","unstructured":"Travers, S.: The complexity of membership problems for circuits over sets of integers. Theoretical Computer Science\u00a0369(1), 211\u2013229 (2006)","journal-title":"Theoretical Computer Science"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BFb0030338","volume-title":"Proceedings Mathematical Foundations of Computer Science","author":"K. Wagner","year":"1984","unstructured":"Wagner, K.: The complexity of problems concerning graphs with regularities. In: Proceedings Mathematical Foundations of Computer Science. LNCS, vol.\u00a0176, pp. 544\u2013552. Springer, Heidelberg (1984)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","first-page":"485","volume-title":"Fundamentals of Computation Theory","author":"K.W. Wagner","year":"1985","unstructured":"Wagner, K.W., Wechsung, G.: On the boolean closure of NP. In: Budach, L. (ed.) FCT 1985. LNCS, vol.\u00a0199, pp. 485\u2013493. Springer, Heidelberg (1985)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/CCC.2000.856751","volume-title":"IEEE Conference on Computational Complexity","author":"K. Yang","year":"2000","unstructured":"Yang, K.: Integer circuit evaluation is PSPACE-complete. In: IEEE Conference on Computational Complexity, pp. 204\u2013213. IEEE Computer Society Press, Los Alamitos (2000)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74510-5_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:21:47Z","timestamp":1619518907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74510-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745099","9783540745105"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74510-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}