Reduction from Vertex Cover to SAT
- From: sarhus <sarhus@xxxxxxxxx>
- Date: Mon, 29 Oct 2007 15:04:59 -0000
Hello,
I have a Vertex Cover problem, and I want to transform it to a SAT
problem.
In this sense I can solve the SAT problem and I will
obtain the solution of the Vertex Cover.
Do you know any useful transformation ?
thanks
Rosario.
.
- Prev by Date: Re: Urgent Recurrence Problem, Please Help !
- Next by Date: Re: Recursively enumerable sets
- Previous by thread: How to abstract a set?
- Next by thread: Re: Recursively enumerable sets
- Index(es):
