In mathematics, a quasi-polynomial (pseudo-polynomial) is a generalization of polynomials. While the coefficients of a polynomial come from a ring, the...

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

science, a function f ( n ) {\displaystyle f(n)} is said to exhibit quasi-polynomial growth when it has an upper bound of the form f ( n ) = 2 O ( ( log...

\mathbb {Z} ^{d}:Ax\leq tb\right\}\right).} In this case, L(P, t) is a quasi-polynomial in t. Just as with integral polytopes, Ehrhart–Macdonald reciprocity...

the weight or the degree of the polynomial. The term quasi-homogeneous comes from the fact that a polynomial f is quasi-homogeneous if and only if f (...

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

NP-hardness and pseudo-polynomial time correspond to encoding the input agents in unary coding. Strongly NP-complete Quasi-polynomial time Michael R. Garey...

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

do not have PTASs. Another deterministic variant of the PTAS is the quasi-polynomial-time approximation scheme or QPTAS. A QPTAS has time complexity npolylog(n)...

x_{n}).} Multi-homogeneous polynomial Quasi-homogeneous polynomial Diagonal form Graded algebra Hilbert series and Hilbert polynomial Multilinear form Multilinear...

The best algorithm for this problem, due to László Babai, runs in quasi-polynomial time. The integer factorization problem is the computational problem...

Lackenby announced a new unknot recognition algorithm that runs in quasi-polynomial time. A useful way to visualise and manipulate knots is to project...

claimed to have proven that the graph isomorphism problem is solvable in quasi-polynomial time. He published preliminary versions of these results in the proceedings...

In mathematics, a quasi-projective variety in algebraic geometry is a locally closed subset of a projective variety, i.e., the intersection inside some...

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

precisely, it is a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number...

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

list of generators, is polynomial-time equivalent to the graph isomorphism problem, and therefore solvable in quasi-polynomial time, that is with running...

optimization problem Quasi-polynomial time, relating to time complexity in computer science QP or EQP, Exact Quantum Polynomial time in computational...

(2000), pp.365–370. P. G. Laird, On characterizations of exponential polynomials, Pacific Journal of Mathematics 80 (1979), pp.503–507. Quasi-polynomial...

In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other, more...

Gaudry, Pierrick; Joux, Antoine; Thomé, Emmanuel (2014). "A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic"...

Unsolved problem in computer science: Can parity games be solved in polynomial time? (more unsolved problems in computer science) Solving a parity game...

{\displaystyle 2^{(\log n)^{1-\epsilon }}} unless NP is contained within quasi-polynomial deterministic time; however, there is a big gap between this inapproximability...

an algebraic equation or polynomial equation is an equation of the form P = 0 {\displaystyle P=0} , where P is a polynomial with coefficients in some...

infinite (Fredholm) determinant whose entries are either specific polynomial or quasi-polynomial functions, or parametric integrals, and their derivatives; 5)...

{\displaystyle {\tfrac {1}{2}}\log _{2}{n}\approx 0.72\ln {n}} , unless NP has quasi-polynomial time algorithms. Feige (1998) improved this lower bound to ( 1 − o...

maximum weight independent set in a d-claw free graph. Cygan presented a quasi-polynomial time algorithm that, for any ε>0, attains a (d+ε)/3 approximation....

tree-like Resolution and Resolution are not automatable even in certain quasi-polynomial time assuming the exponential time hypothesis. Atserias and Müller...