Quasi-polynomial growth
id:
quasi-polynomial-growth-172-2966696
title:
Quasi-polynomial growth
text:
In theoretical computer science, a function f is said to exhibit quasi-polynomial growth when it has an upper bound of the form f = 2 O for some constant c, as expressed using big O notation. That is, it is bounded by an exponential function of a polylogarithmic function. This generalizes the polynomials and the functions of polynomial growth, for which one can take c = 1. A function with quasi-polynomial growth is also said to be quasi-polynomially bounded. Quasi-polynomial growth has been used
brand slug:
wiki
category slug:
encyclopedia
description:
Subexponential bound in computational complexity
original url:
https://en.wikipedia.org/wiki/Quasi-polynomial_growth
date created:
2023-12-03T01:57:52Z
date modified:
2024-09-02T02:24:45Z
main entity:
{"identifier":"Q123879013","url":"https://www.wikidata.org/entity/Q123879013"}
image:
fields total:
13
integrity:
15