Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  give a recursion-theoretic characterization of the complexity classes NC k for  k i¾? 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computations (mutual in place recursion). This is, to our knowledge, the first exact characterization of NC k by function algebra over infinite domains in implicit complexity.
['Guillaume Bonfante', 'Reinhard Kahle', 'Jean-Yves Marion', 'Isabel Oitavem']
I am writing a research paper on a idea Recursion Schemata for NCk
[{"from": "human", "value": "I am writing a research paper on a idea Recursion Schemata for NCk"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  give a recursion-theoretic characterization of the complexity classes NC k for  k i\u00be? 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computations (mutual in place recursion). This is, to our knowledge, the first exact characterization of NC k by function algebra over infinite domains in implicit complexity."}]