<p>While it's not inconceivable that the technical obstacles you mention could be overcome somehow, I think that there is very little motivation at present to do so, for the simple reason that (at least as far as I am aware) the difficulty of NP-hard problems in practice seems, empirically, to have little to do with their closeness to the 3-SAT phase transition.</p>

<p>Contrast this with some other ways to rank NP-hard problems in terms of difficulty: There is some empirical correlation between NP-hard problems that are easy in practice and NP-hard problems that are <i>easy to approximate</i>, or that are <i>fixed-parameter tractable</i> (in the sense of parameterized complexity).  Appropriate notions of reduction have been developed in these cases that partially explain the empirical observations.  However, there currently seems to be no empirical indication that most NP-hard problems that are difficult in practice are difficult <i>because</i> of their close relationship to 3-SAT instances near the phase transition.  So it does not make too much sense to develop a theory to "explain" something that does not appear to be true in practice.</p>

CC BY-SA 4.0
2019-01-24T16:49:09.210Z
@CarlosLinaresLópez : *Fundamentals of Parameterized Complexity* by Downey and Fellows (Springer, 2013) gives some information about the $W$-hierarchy of parameterized complexity. *Approximation Algorithms for NP-Hard Problems* by Dorit Hochbaum (ed.) ranks some NP-hard problems by difficulty of approximation. Hochbaum's book is a bit old so you may also want to look at more recent books on approximation algorithms.
Timothy Chow
CC BY-SA 3.0
2011-11-29T18:30:08.273Z
2011-11-29T18:30:08.273Z
Timothy Chow
<p>This question is tightly related to another post: <a href="https://cstheory.stackexchange.com/questions/3841/phase-transitions-in-np-hard-problems">Phase Transitions in NP Hard Problems</a> but it is somewhat different. While that question is about the hardness of particular instances of NP hard problems, this is about <strong>ranking</strong> the difficulty of the same instances.</p>
<p>There is a lot of bibliography on the effect known as <em>Phase Transition</em>. In particular for the case of random 3-SAT formulae in Conjunctive Normal Form (CNF), it is known that there is a value R of the ratio of clauses to variables such that for all r &lt; R the formula can be satisfied with high probability and for r &gt; R the formula is unsatisfiable with high probability. The Phase Transition effect happens near R and it has the remarkable effect that solving the satisfiability problem for those formulas is extremely hard in practice.</p>
<p>Since for proving NP hardness of a given problem it is needed to show that there is a polynomial time Turing-reduction to it of an NP-complete problem and that problems that are NP-complete can be transformed in polynomial time among them, then the following question naturally arises:</p>
<p>Is it possible to <strong>rank</strong> the difficulty of NP hard problems in practice using the Phase Transition of 3-SAT CNF as an indicator? The intuition is that one problem P1 can be expected to be harder than P2 if its 3-SAT encoding is nearer R (which is known to be near 4.2). Note that this idea does not necessarily bound each particular instance to a particular difficulty, it just ranks them.</p>
<p>There are a number of counter arguments, among them:</p>
<ol>
<li>The Phase Transition of 3-SAT CNF formula applies to random formulae. However, a particular instance in a different problem has some structure that might be exploited by solvers for that problem ---this was already pointed out by Peter Shor in the aforementioned question.</li>
<li>It might be the case that the particular encoding used for transforming the particular instances in our problem to 3-SAT plays a crucial role in the ratio of clauses to variables leading to misleading values, hence misclassifications ---this concern is raised by Kaveh in the comments to this question.</li>
<li>Serge (according to my understanding from his comment to this question) raises the issue that one might artificially complicate the original NP hard problem so that it results in a 3CNF formula that alters the ratio of clauses to variables while preserving the satisfiability.</li>
</ol>
<p>As for 1, all problems might share the same class of regularity so that ranking problems (instead of characterizing the difficulty) might apply; as for 2, there are encodings in particular problems which are known to be non-redundant w.r.t the Unit Propagation rule so that those should be preferred and maybe they avoid those misclassifications. An example is <a href="https://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1454" rel="nofollow noreferrer">Sideris et al., 2010</a> for the case of Propositional Planning. As for 3, <a href="https://www.ijcai.org/Proceedings/1991-1/" rel="nofollow noreferrer">Cheeseman et al., 1991</a> already considered the issue of whether mappings between problems preserve or not the phase transition effect and their preliminary experiments seem to support their conjecture, provided that one reduces the original NP problem and even that &quot;<em>can be further reduced by applying resolution to the clauses</em>&quot;.</p>
<p>Do this all make sense to you? are you aware of any bibliographical references about this? Any guidance would be largely acknowledged!</p>

CC BY-SA 3.0
2011-11-27T13:37:27.693Z
I would guess the answer would depend on the particular reduction to SAT that one uses though there might be a way to get around that.
Kaveh
CC BY-SA 3.0
2011-11-27T14:09:24.867Z
One more counter argument is that one can always add a very sparse or a very dense satisfiable disjoint component to a 3CNF formula, altering the ratio of clauses to variables and preserving its satisfiability.
Serge Gaspers
CC BY-SA 3.0
2011-11-28T20:57:33.423Z
@Kaveh: thanks a lot for your comments! The idea would be using non-redundant encodings to 3-SAT as in [Sideris et al. 2010]. I am not claiming that this will work, but it seems to be the right thing to do. I have edited the question with your comment. Thanks again!
Carlos Linares López
CC BY-SA 3.0
2011-11-28T20:59:10.237Z
@Serge: good point Serge! [Cheesemann et al., 1991] already examined the question of whether mappings between problems preserve the phase transition effect both for NP problems and problems in P (to prove that they do not become NP when been artificially extended to 3-SAT, for example) and their results support those claims provided that they start with some preliminary reductions, maybe applying the Unit Propagation rule. I have edited my question with your comments. Thanks a lot!
Carlos Linares López
<cc.complexity-theory><np-hardness><sat>
Ranking the Difficulty of NP Hard Problems in Practice
Carlos Linares López
# Ranking the Difficulty of NP Hard Problems in Practice

(Asked by: username_0 on 2011-11-27)

This question is tightly related to another post: [Phase Transitions in NP Hard Problems](https://cstheory.stackexchange.com/questions/3841/phase-transitions-in-np-hard-problems) but it is somewhat different. While that question is about the hardness of particular instances of NP hard problems, this is about **ranking** the difficulty of the same instances.

There is a lot of bibliography on the effect known as *Phase Transition*. In particular for the case of random 3-SAT formulae in Conjunctive Normal Form (CNF), it is known that there is a value R of the ratio of clauses to variables such that for all r < R the formula can be satisfied with high probability and for r > R the formula is unsatisfiable with high probability. The Phase Transition effect happens near R and it has the remarkable effect that solving the satisfiability problem for those formulas is extremely hard in practice.

Since for proving NP hardness of a given problem it is needed to show that there is a polynomial time Turing-reduction to it of an NP-complete problem and that problems that are NP-complete can be transformed in polynomial time among them, then the following question naturally arises:

Is it possible to **rank** the difficulty of NP hard problems in practice using the Phase Transition of 3-SAT CNF as an indicator? The intuition is that one problem P1 can be expected to be harder than P2 if its 3-SAT encoding is nearer R (which is known to be near 4.2). Note that this idea does not necessarily bound each particular instance to a particular difficulty, it just ranks them.

There are a number of counter arguments, among them:

1. The Phase Transition of 3-SAT CNF formula applies to random formulae. However, a particular instance in a different problem has some structure that might be exploited by solvers for that problem ---this was already pointed out by Peter Shor in the aforementioned question.
2. It might be the case that the particular encoding used for transforming the particular instances in our problem to 3-SAT plays a crucial role in the ratio of clauses to variables leading to misleading values, hence misclassifications ---this concern is raised by Kaveh in the comments to this question.
3. Serge (according to my understanding from his comment to this question) raises the issue that one might artificially complicate the original NP hard problem so that it results in a 3CNF formula that alters the ratio of clauses to variables while preserving the satisfiability.

As for 1, all problems might share the same class of regularity so that ranking problems (instead of characterizing the difficulty) might apply; as for 2, there are encodings in particular problems which are known to be non-redundant w.r.t the Unit Propagation rule so that those should be preferred and maybe they avoid those misclassifications. An example is [Sideris et al., 2010](https://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1454) for the case of Propositional Planning. As for 3, [Cheeseman et al., 1991](https://www.ijcai.org/Proceedings/1991-1/) already considered the issue of whether mappings between problems preserve or not the phase transition effect and their preliminary experiments seem to support their conjecture, provided that one reduces the original NP problem and even that "*can be further reduced by applying resolution to the clauses*".

Do this all make sense to you? are you aware of any bibliographical references about this? Any guidance would be largely acknowledged!

**Tags:** cc.complexity-theory, np-hardness, sat
> **Comments:**
> **username_1**: I would guess the answer would depend on the particular reduction to SAT that one uses though there might be a way to get around that.  
> **username_2**: One more counter argument is that one can always add a very sparse or a very dense satisfiable disjoint component to a 3CNF formula, altering the ratio of clauses to variables and preserving its satisfiability.  
> **username_0**: @Kaveh: thanks a lot for your comments! The idea would be using non-redundant encodings to 3-SAT as in [Sideris et al. 2010]. I am not claiming that this will work, but it seems to be the right thing to do. I have edited the question with your comment. Thanks again!  
> **username_0**: @Serge: good point Serge! [Cheesemann et al., 1991] already examined the question of whether mappings between problems preserve the phase transition effect both for NP problems and problems in P (to prove that they do not become NP when been artificially extended to 3-SAT, for example) and their results support those claims provided that they start with some preliminary reductions, maybe applying the Unit Propagation rule. I have edited my question with your comments. Thanks a lot!  

---

## 1 answers

### Answer by username_3 on 2011-11-29. Score: 16 | Accepted answer

While it's not inconceivable that the technical obstacles you mention could be overcome somehow, I think that there is very little motivation at present to do so, for the simple reason that (at least as far as I am aware) the difficulty of NP-hard problems in practice seems, empirically, to have little to do with their closeness to the 3-SAT phase transition.

Contrast this with some other ways to rank NP-hard problems in terms of difficulty: There is some empirical correlation between NP-hard problems that are easy in practice and NP-hard problems that are *easy to approximate*, or that are *fixed-parameter tractable* (in the sense of parameterized complexity). Appropriate notions of reduction have been developed in these cases that partially explain the empirical observations. However, there currently seems to be no empirical indication that most NP-hard problems that are difficult in practice are difficult *because* of their close relationship to 3-SAT instances near the phase transition. So it does not make too much sense to develop a theory to "explain" something that does not appear to be true in practice.

> **Comments:**
> **username_3**: @CarlosLinaresLópez : *Fundamentals of Parameterized Complexity* by Downey and Fellows (Springer, 2013) gives some information about the $W$-hierarchy of parameterized complexity. *Approximation Algorithms for NP-Hard Problems* by Dorit Hochbaum (ed.) ranks some NP-hard problems by difficulty of approximation. Hochbaum's book is a bit old so you may also want to look at more recent books on approximation algorithms.  

---

