{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T09:28:42Z","timestamp":1767864522387,"version":"3.49.0"},"reference-count":11,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2003,11,26]],"date-time":"2003-11-26T00:00:00Z","timestamp":1069804800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[2004,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A two\u2010sorted term system characterizing<jats:italic>NC<\/jats:italic>implicitly is described. The term system is defined over the tree algebra \ud835\udd4b, the free algebra generated by<jats:bold>0<\/jats:bold>,<jats:bold>1<\/jats:bold>and \u2217\ufe01, and the recursion scheme uses pointers over tier 0. This differs from previous characterizations of<jats:italic>NC<\/jats:italic>, where tier 1 pointers were used or full parameter substitution over tier 0 was allowed. (\u00a9 2003 WILEY\u2010VCH Verlag GmbH &amp; Co. KGaA, Weinheim)<\/jats:p>","DOI":"10.1002\/malq.200310070","type":"journal-article","created":{"date-parts":[[2004,1,16]],"date-time":"2004-01-16T15:51:49Z","timestamp":1074268309000},"page":"9-17","source":"Crossref","is-referenced-by-count":7,"title":["Characterizing<i>NC<\/i>with tier 0 pointers"],"prefix":"10.1002","volume":"50","author":[{"given":"Isabel","family":"Oitavem","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2003,11,26]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"K.Aehlig J.Johannsen H.Schwichtenberg andS.Terwijn Linear ramified higher type recursion and parallel complexity. In: Proof Theory in Computer Science (R. Kahle et al. eds.) Lecture Notes in Computer Science 2183 pp. 1\u201321 (Springer\u2010Verlag Berlin et al. 2001).","DOI":"10.1007\/3-540-45504-3_1"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"J. L.Balc\u00e1zar J.D\u00edaz andJ.Gabarr\u00f3 Structural Complexity II (Springer\u2010Verlag Berlin et al. 1990).","DOI":"10.1007\/978-3-642-75357-2"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201998"},{"key":"e_1_2_1_5_2","unstructured":"S.Bellantoni andI.Oitavem Separating NC along the\u03b4axis. ICC Special issue of TCS (to appear)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"D.Leivant Ramified recurrence and computational complexity I: Word recurrence and poly\u2010time. In: Feasible Mathematics II (P. Clote and J. B. Remmel eds.) pp. 320\u2013343 (1995).","DOI":"10.1007\/978-1-4612-2566-9_11"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"D.Leivant A characterization of NC by tree recurrence. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS 1998) pp. 716\u2013724 (IEEE Computer Society 1998).","DOI":"10.1109\/SFCS.1998.743522"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"D.Leivant andJ.Marion Ramified recurrence and computational complexity II: Substitution and poly\u2010space. Lecture Notes of Computer Sciences 993 486\u2013500 (Springer\u2010Verlag Berlin et al. 1994).","DOI":"10.1007\/BFb0022277"},{"key":"e_1_2_1_10_2","unstructured":"I.Oitavem Classes of Computational Complexity: Implicit Characterizations (a Study in Mathematical Logic). PhD Dissertation Faculdade de Ci\u00eancias da Universidade de Lisboa 2001."},{"key":"e_1_2_1_11_2","unstructured":"I.Oitavem A term system for Pspace. Submitted."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90038-6"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.200310070","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.200310070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T23:28:03Z","timestamp":1734218883000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.200310070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11,26]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["10.1002\/malq.200310070"],"URL":"https:\/\/doi.org\/10.1002\/malq.200310070","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,11,26]]}}}