language agnostic - Interesting algorithm problem -


I have an interesting algorithm problem related to the problem of simulation of electronic designs. Say for example, I have a gate in which there are some gates. A 3-Input and Gate say, out of these 8 inputs, if I only feed in two inputs ( 000) and (111) , both of me Potential output i.e., 0 and 1 is available.

So the minimum set of these input vectors, which produces both '0' and '1' on production, are {000, 111}.

The problem has been given a design, some gates arrangement, to find the minimum set of algorithm input vectors which produces both states (i.e. 0 and 1) on the final output.

is equivalent to solving your problem. That's why NP-is complete.

To get an input, you can select an arbitrary input and see if it will say 0 or 1. For the input that gives the second output, you get the SAT Solver.

Wikipedia has some suggestions that can be used:

  • etc ...

If you do not want to apply it, then there are tools that are ready-using SAT solvers:

< Ul>
  • (open source LGPL)
  • (free for non commercial use)

  • Comments

    Popular posts from this blog

    Eclipse CDT variable colors in editor -

    AJAX doesn't send POST query -

    wpf - Custom Message Box Advice -