Switch to: Citations

References in:

Characterizing PSPACE with pointers

Mathematical Logic Quarterly 54 (3):323-329 (2008)

Add references

You must login to add references.

Characterizing NC with tier 0 pointers.Isabel Oitavem - 2004 - Mathematical Logic Quarterly 50 (1):9.details A two-sorted term system characterizing NC implicitly is described. The term system is defined over the tree algebra [MATHEMATICAL DOUBLE-STRUCK CAPITAL T], the free algebra generated by 0, 1 and ∗, and the recursion scheme uses pointers over tier 0. This differs from previous characterizations of NC, where tier 1 pointers were used or full parameter substitution over tier 0 was allowed. Download Export citation Bookmark 3 citations
Characterizing NC with tier 0 pointers.Isabel Oitavern - 2004 - Mathematical Logic Quarterly 50 (1):9-17.details A two‐sorted term system characterizing NC implicitly is described. The term system is defined over the tree algebra ????, the free algebra generated by 0, 1 and ∗︁, and the recursion scheme uses pointers over tier 0. This differs from previous characterizations of NC, where tier 1 pointers were used or full parameter substitution over tier 0 was allowed. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). Download Export citation Bookmark 3 citations

1