{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T12:33:25Z","timestamp":1774355605329,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Membr Comput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s41965-020-00052-0","type":"journal-article","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T15:03:10Z","timestamp":1606921390000},"page":"303-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Simulating counting oracles with cooperation"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8105-4371","authenticated-orcid":false,"given":"Alberto","family":"Leporati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Manzoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giancarlo","family":"Mauri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1544-028X","authenticated-orcid":false,"given":"Antonio E.","family":"Porreca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Zandron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,2]]},"reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-1-4612-1872-2_4","volume-title":"Complexity theory retrospective\u00a0II","author":"L Fortnow","year":"1997","unstructured":"Fortnow, L. (1997). Counting complexity. In L. A. Hemaspaandra & A. L. Selman (Eds.), Complexity theory retrospective\u00a0II (pp. 81\u2013107). New York: Springer."},{"key":"52_CR2","unstructured":"Ionescu, M., P\u0103un, Gh., Yokomori, T. (2006). Spiking neural P\u00a0systems. Fundamenta Informaticae 71(2\u20133), 279\u2013308. https:\/\/content.iospress.com\/articles\/fundamenta-informaticae\/fi71-2-3-08."},{"key":"52_CR3","doi-asserted-by":"publisher","unstructured":"Leporati, A., Manzoni, L., Mauri, G., Porreca, A.E., Zandron, C. (2014). Simulating elementary active membranes, with an application to the P\u00a0conjecture. In Gheorghe, M., Rozenberg, G., Sos\u00edk, P., Zandron, C. (Eds.). Membrane computing, 15th international conference, CMC 2014. Lecture notes in computer science, vol.\u00a08961, pp. 284\u2013299. Springer. https:\/\/doi.org\/10.1007\/978-3-319-14370-5_18.","DOI":"10.1007\/978-3-319-14370-5_18"},{"issue":"1\u20132","key":"52_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.3233\/FI-2015-1201","volume":"138","author":"A Leporati","year":"2015","unstructured":"Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2015). Membrane division, oracles, and the counting hierarchy. Fundamenta Informaticae, 138(1\u20132), 97\u2013111. https:\/\/doi.org\/10.3233\/FI-2015-1201.","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"52_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s11047-016-9565-2","volume":"15","author":"A Leporati","year":"2016","unstructured":"Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2016). Monodirectional P\u00a0systems. Natural Computing, 15(4), 551\u2013564. https:\/\/doi.org\/10.1007\/s11047-016-9565-2.","journal-title":"Natural Computing"},{"key":"52_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jcss.2017.06.008","volume":"90","author":"A Leporati","year":"2017","unstructured":"Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2017). Characterising the complexity of tissue P systems with fission rules. Journal of Computer and System Sciences, 90, 115\u2013128. https:\/\/doi.org\/10.1016\/j.jcss.2017.06.008.","journal-title":"Journal of Computer and System Sciences"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.tcs.2017.03.045","volume":"701","author":"A Leporati","year":"2017","unstructured":"Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2017). The counting power of P systems with antimatter. Theoretical Computer Science, 701, 161\u2013173. https:\/\/doi.org\/10.1016\/j.tcs.2017.03.045.","journal-title":"Theoretical Computer Science"},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tcs.2018.06.012","volume":"805","author":"A Leporati","year":"2020","unstructured":"Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2020). Subroutines in P systems and closure properties of their complexity classes. Theoretical Computer Science, 805, 193\u2013205. https:\/\/doi.org\/10.1016\/j.tcs.2018.06.012.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"52_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0304-3975(02)00659-X","volume":"296","author":"C Mart\u00edn-Vide","year":"2003","unstructured":"Mart\u00edn-Vide, C., P\u0103un, Gh., Pazos, J., & Rodr\u00edguez-Pat\u00f3n, A. (2003). Tissue P\u00a0systems. Theoretical Computer Science, 296(2), 295\u2013326. https:\/\/doi.org\/10.1016\/S0304-3975(02)00659-X.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"52_CR10","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s11047-010-9244-7","volume":"10","author":"N Murphy","year":"2011","unstructured":"Murphy, N., & Woods, D. (2011). The computational power of membrane systems under tight uniformity conditions. Natural Computing, 10(1), 613\u2013632. https:\/\/doi.org\/10.1007\/s11047-010-9244-7.","journal-title":"Natural Computing"},{"issue":"2","key":"52_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s41965-018-00004-9","volume":"1","author":"D Orellana-Mart\u00edn","year":"2019","unstructured":"Orellana-Mart\u00edn, D., Valencia-Cabrera, L., Riscos-N\u00fa\u00f1ez, A., & P\u00e9rez-Jim\u00e9nez, M. J. (2019). Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems. Journal of Membrane Computing, 1(2), 85\u201392. https:\/\/doi.org\/10.1007\/s41965-018-00004-9.","journal-title":"Journal of Membrane Computing"},{"key":"52_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.tcs.2018.12.024","volume":"777","author":"D Orellana-Mart\u00edn","year":"2019","unstructured":"Orellana-Mart\u00edn, D., Valencia-Cabrera, L., Riscos-N\u00fa\u00f1ez, A., & P\u00e9rez-Jim\u00e9nez, M. J. (2019). A path to computational efficiency through membrane computing. Theoretical Computer Science, 777, 443\u2013453. https:\/\/doi.org\/10.1016\/j.tcs.2018.12.024.","journal-title":"Theoretical Computer Science"},{"key":"52_CR13","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1993","unstructured":"Papadimitriou, C. H. (1993). Computational complexity. Boston: Addison-Wesley."},{"issue":"1","key":"52_CR14","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"Gh P\u0103un","year":"2000","unstructured":"P\u0103un, Gh. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108\u2013143. https:\/\/doi.org\/10.1006\/jcss.1999.1693.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"52_CR15","first-page":"75","volume":"6","author":"Gh P\u0103un","year":"2001","unstructured":"P\u0103un, Gh. (2001). P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics, 6(1), 75\u201390.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"1","key":"52_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(02)00136-6","volume":"287","author":"Gh P\u0103un","year":"2002","unstructured":"P\u0103un, Gh., & Rozenberg, G. (2002). A guide to membrane computing. Theoretical Computer Science, 287(1), 73\u2013100. https:\/\/doi.org\/10.1016\/S0304-3975(02)00136-6.","journal-title":"Theoretical Computer Science"},{"key":"52_CR17","volume-title":"The Oxford handbook of membrane computing","year":"2010","unstructured":"P\u0103un, Gh., Rozenberg, G., & Salomaa, A. (Eds.). (2010). The Oxford handbook of membrane computing. Oxford: Oxford University Press."},{"key":"52_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane computing: An introduction","author":"Gh P\u0103un","year":"2002","unstructured":"P\u0103un, Gh. (2002). Membrane computing: An introduction. New York: Springer."},{"key":"52_CR19","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/s41965-019-00017-y","volume":"1","author":"P Sos\u00edk","year":"2019","unstructured":"Sos\u00edk, P. (2019). P systems attacking hard problems beyond NP: A survey. Journal of Membrane Computing, 1, 198\u2013208. https:\/\/doi.org\/10.1007\/s41965-019-00017-y.","journal-title":"Journal of Membrane Computing"},{"issue":"1","key":"52_CR20","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jcss.2006.10.001","volume":"73","author":"P Sos\u00edk","year":"2007","unstructured":"Sos\u00edk, P., & Rodr\u00edguez-Pat\u00f3n, A. (2007). Membrane computing and complexity theory: A characterization of PSPACE. Journal of Computer and System Sciences, 73(1), 137\u2013152. https:\/\/doi.org\/10.1016\/j.jcss.2006.10.001.","journal-title":"Journal of Computer and System Sciences"},{"key":"52_CR21","unstructured":"The P systems webpage. http:\/\/ppage.psystems.eu\/."},{"issue":"1\u2014-2","key":"52_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.25596\/jalc-2016-107","volume":"21","author":"L Valencia-Cabrera","year":"2016","unstructured":"Valencia-Cabrera, L., Orellana-Mart\u00edn, D., Mart\u00ednez-del-Amor, M. A., Riscos-N\u00fa\u00f1ez, A., & P\u00e9rez-Jim\u00e9nez, M. J. (2016). Polarizationless P\u00a0systems with active membranes: Computational complexity aspects. Journal of Automata, Languages and Combinatorics, 21(1\u2014-2), 107\u2013123. https:\/\/doi.org\/10.25596\/jalc-2016-107.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"52_CR23","doi-asserted-by":"publisher","unstructured":"Zandron, C., Ferretti, C., & Mauri, G. (2001). Solving NP-complete problems using P\u00a0systems with active membranes. In Antoniou, I., Calude, C. S., & Dinneen, M. J. (Eds.). Unconventional models of Computation, UMC\u20192K, proceedings of the second international conference (pp. 289\u2013301). Springer. https:\/\/doi.org\/10.1007\/978-1-4471-0313-4_21.","DOI":"10.1007\/978-1-4471-0313-4_21"}],"container-title":["Journal of Membrane Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-020-00052-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41965-020-00052-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-020-00052-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T17:13:24Z","timestamp":1607620404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41965-020-00052-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["52"],"URL":"https:\/\/doi.org\/10.1007\/s41965-020-00052-0","relation":{},"ISSN":["2523-8906","2523-8914"],"issn-type":[{"value":"2523-8906","type":"print"},{"value":"2523-8914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"10 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}