Subject
Software,Theoretical Computer Science,Computational Theory and Mathematics,Logic
Reference14 articles.
1. Choiceless polynomial time;Gurevich;Ann. Pure Appl. Log.,1999
2. Backing up in singly linked lists;Petersen Amir;J. ACM,2006
3. Applications of Finite Fields;Menezes,1993
4. Finite algorithmic procedures and computation theories;Moldestad;Math. Scand.,1980
5. Algorithmic procedures;Friedman;Trans. Am. Math. Soc.,1992
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Abstract Recursion and Intrinsic Complexity;2018-11-23
2. General index;Abstract Recursion and Intrinsic Complexity
3. Symbol index;Abstract Recursion and Intrinsic Complexity
4. Polynomial nullity (0-testing);Abstract Recursion and Intrinsic Complexity
5. Non-uniform complexity in N;Abstract Recursion and Intrinsic Complexity