TAUTOLOGY and SAT
- From: cplxphil@xxxxxxxxx
- Date: Sun, 13 Jul 2008 08:33:16 -0700 (PDT)
Hi, I'm relocating this from the other thread I posted this in...I
didn't intend to change the focus from the original poster's question,
I apologize.
But here is my question...is it true that TAUTOLOGY and SAT are
polynomial time equivalent? It seems to me that they must be, because
given a propositional formula, that formula is satisfiable if its
negation is not a tautology, and a formula is a tautology if its
negation is not satisfiable.
Am I correct in this? I read somewhere that this was not true, but I
do not see why not. (I don't know if the source was reliable or
not.) This seems perfectly logical to me, and it's a many-one
reduction.
-Phil
.
- Follow-Ups:
- Re: TAUTOLOGY and SAT
- From: Daniel A. Jimenez
- Re: TAUTOLOGY and SAT
- Prev by Date: Is this language context free?
- Next by Date: Re: Is this language context free?
- Previous by thread: Is this language context free?
- Next by thread: Re: TAUTOLOGY and SAT
- Index(es):
Relevant Pages
|