Sentence examples for operating in polynomial time from inspiring English sources

QMC is a quartet amalgamation method, operating in polynomial time and providing no guarantees with respect to its optimization problem, MQC.

There exist problems for which the most efficient known decision algorithm has exponential time complexity in the worst case (and in fact are known to be \ \textbf{NP}\ -hard in the general case – see Section 3.2) but which operate in polynomial time either in the average case or for a large subclass of problem instances of practical interest.

This SpringerBrief also investigate assumptions under which our algorithms run in polynomial time in the data complexity.

All other operations can be done in polynomial time.

NP stands for the class of problems that can be verified in polynomial time — quickly.

The holy grail would be an encryption technique that cannot be broken in polynomial time.

TSP-Based Curve Reconstruction in Polynomial Time.

Optimal Oblivious Routing in Polynomial Time.

When solving things, we want to keep them in polynomial time if we still want to have time for lunch.

P stands for the class of problems that can be solved in polynomial time, or reasonably quickly.

Separately, if a problem can have solutions checked in polynomial time, then that problem is in the "NP" category: which stands for "nondeterministic polynomial time" (a solution can be checked but not necessarily determined).