Publisher
Springer Science and Business Media LLC
Reference3 articles.
1. Kaplan, H. L. Clock-driven FORTRAN task scheduling in a multiprogramming environment.Behavior Research Methods & Instrumentation, 1977,9, 176–183.
2. Karp, R. M. Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.),Complexity of computer computations. New York: Plenum Press, 1972. Pp. 85–104.
3. Karp, R. M. The probabilistic analysis of combinatorial search alogrithms. In J. F. Traub (Ed.),Algorithms and complexity: New directions and recent results. New York: Academic Press, 1976. Pp. 1–19.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The role of practice in fact retrieval.;Journal of Experimental Psychology: Learning, Memory, and Cognition;1985-01
2. A test of parallel versus serial processing applied to memory retrieval;Journal of Mathematical Psychology;1981-12
3. Memory for logical quantifiers;Journal of Verbal Learning and Verbal Behavior;1981-06
4. Effects of prior knowledge on memory for new information;Memory & Cognition;1981-05
5. Special purpose languages for behavioural experiments;International Journal of Man-Machine Studies;1981-04