Complexity problems in computational theory
-
Published:1981-12-31
Issue:6
Volume:36
Page:23-125
-
ISSN:0036-0279
-
Container-title:Russian Mathematical Surveys
-
language:
-
Short-container-title:Russ. Math. Surv.
Subject
General Mathematics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Theories of Computational Complexity;Elements of the General Theory of Optimal Algorithms;2021
2. Sorting, linear time and the satisfiability problem;Annals of Mathematics and Artificial Intelligence;1996-12
3. Kolmogorov’s Algorithms or Machines;Mathematics and Its Applications;1993
4. Algorithms constructing a representative vector criterion for a binary preference relation;Computational Mathematics and Modeling;1990
5. Computer Algebra: Past and Future;Journal of Symbolic Computation;1986-09