P-Problem

A problem is assigned to the P (Polynomial time) class if the number of steps is bounded by a Polynomial.

References

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.

• Weekday
• Weibull Distribution
• Weierstrass M-Test
• Weierstraß Approximation Theorem
• Weierstraß-Casorati Theorem
• Weierstraß Constant
• Weierstraß Elliptic Function
• Weierstraß-Erdman Corner Condition
• Weierstraß Extreme Value Theorem
• Weierstraß Form
• Weierstraß Function
• Weierstraß Intermediate Value Theorem
• Weierstraß Point
• Weierstraß Product Inequality
• Weierstraß's Gap Theorem
• Weierstraß Sigma Function
• Weierstraß's Polynomial Theorem
• Weierstraß's Theorem
• Weierstraß Zeta Function
• Weighings
• Weight
• Weighted Tree
• Weight Function
• Weighting Function
• Weingarten Equations