Publisher
Springer Berlin Heidelberg
Reference50 articles.
1. Adleman, L., Manders, K.: Computational complexity of decision procedures for polynomials. In: 16th Annual Symposium on Foundations of Computer Science, pp. 169–177 (1975)
2. Adleman, L., Manders, K.: Diophantine complexity. In: 17th Annual Symposium on Foundations of Computer Science, Houston, Texas, October 25-26, 1976, pp. 81–88. IEEE, Los Alamitos (1976)
3. Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the ACM 14(2), 322–336 (1967)
4. Chaitin, G.: Algorithmic Information Theory. Cambridge University Press, Cambridge (1987)
5. Davis, M.: Arithmetical problems and recursively enumerable predicates (abstract). Journal of Symbolic Logic 15(1), 77–78 (1950)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On the Power of Recursive Word-Functions Without Concatenation;Descriptional Complexity of Formal Systems;2022
2. The undecidability of proof search when equality is a logical connective;Annals of Mathematics and Artificial Intelligence;2021-07-03
3. SIA;Proceedings of the 2021 International Conference on Management of Data;2021-06-09
4. Martin Davis and Hilbert’s Tenth Problem;Outstanding Contributions to Logic;2016
5. A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings;Frontiers of Combining Systems;2015