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...

such a polynomial time algorithm is an open problem. Other computational problems with quasi-polynomial time solutions but no known polynomial time solution...

to take quasi-polynomial time. As well as time complexity, some algorithms require quasi-polynomial space complexity, use a quasi-polynomial number of...

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...

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...

deterministic variant of the PTAS is the quasi-polynomial-time approximation scheme or QPTAS. A QPTAS has time complexity npolylog(n) for each fixed ε...

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...

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...

function with quasi-polynomial growth, and algorithms with this as their time complexity are said to take quasi-polynomial time. All polylogarithmic...

Under the exponential time hypothesis, there exist natural problems that require quasi-polynomial time, and can be solved in that time, including finding...