Here, as the main theoretical result, it is proved, the non-trivial and highly significant fact, that the probability of requiring a value of for obtaining a solution decreases exponentially as a function of k .
← all excerpts
Solving hard computational problems efficiently: asymptotic parametric complexity 3-coloring algorithm.
1
—
—