Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH

Author： Bournez O.   Cucker F.   de Naurois P.J.   Marion J.-Y.  

Publisher： Elsevier

ISSN： 1571-0661

Source： Electronic Notes in Theoretical Computer Science, Vol.90, Iss.1, 2003-11, pp. : 3-14

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Computing minimum with primitive recursion over lists

By Fredholm D.  

Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. : 269-276

Elsevier

Access to resources Recommend Favorite

Elementary decompositions of arbitrary maps over finite sets

By Burckel S.  

Journal of Symbolic Computation, Vol. 37, Iss. 3, 2004-03 ,pp. : 305-310

Elsevier

Access to resources Recommend Favorite

A cryptographic processor for arbitrary elliptic curves over GF(2m)

By Eberle Hans   Gura Nils   Shantz Sheueling Chang   Gupta Vipul  

International Journal of Embedded Systems, Vol. 3, Iss. 4, 2009-01 ,pp. : 241-255

Inderscience Publishers

Access to resources Recommend Favorite

Calculating Invariant Rings of Finite Groups over Arbitrary Fields

By Kemper G.  

Journal of Symbolic Computation, Vol. 21, Iss. 3, 1996-03 ,pp. : 351-366

Academic Press

Access to resources Recommend Favorite

Derivations and Radicals of Polynomial Ideals over Fields of Arbitrary Characteristic

By Fortuna E.   Gianni P.   Trager B.  

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 609-625

Academic Press

Access to resources Recommend Favorite