A PLS problem L has a set D _ L of instances which are encoded using polynomial time algorithms is required:
12.
In general, optimal edge coloring is NP-complete, so it is very unlikely that a polynomial time algorithm exists.
13.
Similarly, there are some problems for which we know quasi-polynomial time algorithms, but no polynomial time algorithm is known.
14.
Similarly, there are some problems for which we know quasi-polynomial time algorithms, but no polynomial time algorithm is known.
15.
Since then, holographic reductions have been used extensively as ingredients in both polynomial time algorithms and proofs of # P-hardness.
16.
In 1984, Andrew V . Goldberg developed a polynomial time algorithm to find the maximum density subgraph using a max flow technique.
17.
Cobham's thesis says that a problem can be solved with a feasible amount of resources if it admits a polynomial time algorithm.
18.
This is because exact solution of the full CI determinant is NP-complete, so the existence of a polynomial time algorithm is unlikely.
19.
For restricted versions of this problem, there exist polynomial time algorithms that solve the corresponding optimization problems for a few point symmetries in 2D.
20.
Polynomial time algorithms are known for computing the chromatic polynomial for wider classes of graphs, including chordal graphs and graphs of bounded clique-width.
