单词 | P-Problem |
释义 | P-ProblemA problem is assigned to the P (Polynomial time) class if the number of steps is bounded by a Polynomial. See also Complexity Theory, NP-Complete Problem,NP-Hard Problem, NP-Problem
Borwein, J. M. and Borwein, P. B. Pi and the AGM: A Study in Analytic Number Theory and Computational Complexity. New York: Wiley, 1987. Greenlaw, R.; Hoover, H. J.; and Ruzzo, W. L. Limits to Parallel Computation: P-Completeness Theory. Oxford, England: Oxford University Press, 1995. |
随便看 |
|
数学辞典收录了8975条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。