# How to find for each 3-input boolean function the minimum number of NAND operators needed to compute it [closed]

I need to know for each of the $$2^{2^3}$$ boolean functions with $$3$$ inputs the smallest boolean circuit made only of NAND gates computing it (smallest in terms of the number gates).

I would be glad if someone could tell me a source where I can look this up or a clever procedure to find the minimal circuits myself.

## closed as off-topic by Kristoffer Arnsfelt Hansen, Emil Jeřábek supports Monica, Gamow, Radu GRIGore, D.W.Nov 8 at 19:34

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – Kristoffer Arnsfelt Hansen, Emil Jeřábek supports Monica, Gamow, Radu GRIGore, D.W.
If this question can be reworded to fit the rules in the help center, please edit the question.

For 3 inputs it's not $$2^3$$ functions but $$2^{2^3}$$ functions. Circuit minimization is generally hard. You could try using the aiger package http://fmv.jku.at/aiger/, which will give you a circuit but not necessarily minimal.