# polynomial time

Also found in: Wikipedia.

## polynomial time

[¦päl·ə¦nō·mē·əl ′tīm] (computer science)

The property of the time required to solve a problem on a computer for which there exist constants

*c*and*k*such that, if the input to the problem can be specified in*N*bits, the problem can be solved in*c*×*N*^{ k }elementary operations.McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

## polynomial time

The amount of time it takes for an algorithm to solve a polynomial function, which is a mathematical expression that does not contain fractions or negative numbers (non-negative integers). The time is proportional to the input and very efficient. Contrast with "exponential time," which takes considerably longer to solve the problem.Copyright © 1981-2019 by

**The Computer Language Company Inc**. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.Want to thank TFD for its existence? Tell a friend about us, add a link to this page, or visit the webmaster's page for free fun content.

Link to this page: