Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let introduce the "Exactly $\{m_{1},m_{2}\}$-SAT" problem : Given a CNF formula $F$ and $2$ integers $m_{1}$ and $m_{2}$, is it true that $F$ has exactly $m_{1}$ or $m_{2}$ models ?

I guess Exactly $\{m_{1},m_{2}\}$-SAT ($m_{1}\leq m_{2}$) is many-one polynomial time reducible to the parametrized problem "Exactly $m_2$-SAT" with $m_2$ considered as a parameter : Given a CNF formula $F$ is it true that $F$ has exactly $m_{2}$ models.

Is it correct ?

Thank you for your answer.

share|cite|improve this question
up vote 1 down vote accepted

No, that's not correct. Finding the solution to an Exactly {$m_1$,$m_2$}-SAT problem can't be done with a single call to an Exactly {$m$}-SAT solver for any $m$, so there is no many-one reduction from the former to the latter. The weaker Turing reduction does apply, since you can solve Exactly {$m_1$,$m_2$}-SAT problem with at most two calls to an Exactly {$m$}-SAT solver.

share|cite|improve this answer
Tks for your answer. Let me reformulate the question : consider $m_1$ and $m_2$ as parameters, is it possible to solve Exactly $\{m_1,m_2\}$-SAT in polynomial time with a single call to Exactly $m_2$-SAT ? – Xavier Labouze Jan 2 '12 at 22:34
Only if $m_1 = m_2$. Otherwise the call tells you nothing useful about the $m_1$ case. – Kyle Jones Jan 2 '12 at 23:51

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.