Polynomial delay
id:
polynomial-delay-254-14402387
title:
Polynomial delay
text:
In the analysis of algorithms, an enumeration algorithm is said to have polynomial delay if the time between the output of any one structure and the next is bounded by a polynomial function of the input size, in the worst case.
Polynomial delay implies that the total time used by an algorithm will be polynomial per output item, but is a stronger requirement. This is a desirable property, because it means that any consumer of the stream of outputs will not have to wait idle for a long time from o
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Polynomial_delay
date created:
date modified:
2020-11-20T15:21:41Z
main entity:
{"identifier":"Q25304165","url":"https://www.wikidata.org/entity/Q25304165"}
image:
fields total:
13
integrity:
13