### np-complete

#### Is it possible to find the probability to a solution of NP-complete problems?

The title covers the entirety of the question. Is it possible to derive a function to say with certainty that a proposed solution to a NP-complete problem has a m percent chance of being correct?

I doubt it. For example a random function's probability to be optimal is numberOfOptimalSolutions / searchSpace. So if you know the answer to that, you can deduce the numberOfOptimalSolutions (which is IIRC always harder to know than finding 1 optimal solution to an NP complete problem). The book "In pursuit of the traveling salesman" lists for each construction heuristic in TSP how close (or far) it is in the worst case scenario from the optimal solution. It also mentions the average percentage of being correct for (some of) those algo's, but IIRC it's probably based on sampling and it gets worse as the problem scales out.

### Related Links

Is vertex coloring of hypergraph with no uniformity restriction NP-hard?

Grid dominating set is NP-complete

Given a graph with n vertices and m edges, does it contain a simple cycle of length ⌈n/2⌉?

NP-complete or NP-hard?

Why using linear integer programming (ILP) though it is NP-Complete?

Prove NP-Completeness of generating 2 shortest routes over given edge grouping constraints?

Reduction to Clique prob

Approximation Algorithm between two NP compete problems

Is it possible to find the probability to a solution of NP-complete problems?

Knapsack for each weight having multiple values - Is it possible to solve?

Reduction from Maximum independent set to Dominating set to prove the Dominating set is NP-complete

How I can prove that 2-CNF is not NP-complete?

When NP complete becomes NP hard

Can it be proven no polynomial algorithm exists for an NP-Complete prob.?

Effect of number base when proving NP completeness of numerical problems

How to reduce 3COLOR to 3SAT?