algorithms, an algorithm is said to take quasi-polynomial time if its time complexity is quasi-polynomially bounded. That is, there should exist a constant...
11 KB (1,088 words) - 14:14, 29 July 2024
such a polynomial time algorithm is an open problem. Other computational problems with quasi-polynomial time solutions but no known polynomial time solution...
41 KB (4,998 words) - 19:17, 11 August 2024
to take quasi-polynomial time. As well as time complexity, some algorithms require quasi-polynomial space complexity, use a quasi-polynomial number of...
7 KB (719 words) - 07:23, 1 August 2024
complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is a polynomial in the numeric value of the input (the largest integer...
5 KB (876 words) - 07:57, 4 December 2023
Monotone dualization (category Quasi-polynomial time algorithms)
can be solved in quasi-polynomial time in the combined size of its input and output, but whether they can be solved in polynomial time is an open problem...
24 KB (3,359 words) - 23:42, 5 January 2024
deterministic variant of the PTAS is the quasi-polynomial-time approximation scheme or QPTAS. A QPTAS has time complexity npolylog(n) for each fixed ε...
6 KB (752 words) - 07:41, 7 August 2024
Graph isomorphism problem (category Quasi-polynomial time algorithms)
quasi-polynomial time. As is common for complexity classes within the polynomial time hierarchy, a problem is called GI-hard if there is a polynomial-time...
40 KB (4,094 words) - 05:17, 2 August 2024
Planted clique (category Quasi-polynomial time algorithms)
clique problem; it may be solved in quasi-polynomial time but is conjectured not to be solvable in polynomial time for intermediate values of the clique...
13 KB (1,680 words) - 09:07, 12 August 2024
Polylogarithmic function (category Polynomial stubs)
function with quasi-polynomial growth, and algorithms with this as their time complexity are said to take quasi-polynomial time. All polylogarithmic...
2 KB (230 words) - 04:27, 15 May 2024
Under the exponential time hypothesis, there exist natural problems that require quasi-polynomial time, and can be solved in that time, including finding...
15 KB (1,534 words) - 13:30, 1 August 2024