Minimum vertex cover problem using minsat

In Progress Posted 6 years ago Paid on delivery

$10-30 CAD

Paid on delivery

In Progress Paid on delivery

Polynomial reduction of vertex cover to cnf-sat. to solve vertex cover problem. Prior knowledge is important.

Algorithm C++ Programming Mathematics

Project ID: #15566484

About the project

4 proposals Remote project Active 6 years ago

Looking to make some money?

Benefits of bidding on Freelancer

Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs

4 freelancers are bidding on average $87 for this job

liangjongai's Profile Picture
liangjongai

Hi! I'm interesting your project very well. I am mastering c++ and I'm a good Mathematician. And also I have many experience and good skill about sat algorithm. Let's go ahead with me

$30 CAD in 1 day
(65 Reviews)
5.9
Post a project like this