Category Archives: Boolean optimisation

4-input 2-output Boolean circuits

In 2005, Donald Knuth determined the minimum cost required to implement each of the 2^32 different 5-input 1-output Boolean functions as a circuit composed entirely of: 2-input gates (there are 16 of these), each of which has cost 1; 1-input … Continue reading

Posted in Boolean optimisation | 2 Comments

Five-input Boolean circuits

Over the past few weeks, I’ve been investigating Boolean optimisation. That is to say, given some circuit of logic gates that implements a particular n-input m-output function, find a more efficient circuit that implements the same function. In practical applications, … Continue reading

Posted in Boolean optimisation | 3 Comments