Overview

complexity


Show Summary Details

Quick Reference

A measure of the computer time or space required to solve a problem by means of an algorithm of interest, expressed as a function of the dimensions of the problem. If a problem with n dimensions can be solved in at most P(n) time units, where P is a polynomial, then the algorithm is said to have polynomial–time complexity.

Subjects: Computing — Probability and Statistics.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.