Category Archives: Boolean optimisation

Searching for optimal Boolean chains

Posted on March 2, 2023 by apgoucher

I gave a half-hour talk on Tuesday about the project to search for optimal Boolean chains for all equivalence classes of 5-input 1-output and 4-input 2-output functions. The talk was not recorded, but the slides and transcript are included here … Continue reading →

Posted in Boolean optimisation | Leave a comment

4-input 2-output Boolean circuits

Posted on June 30, 2020 by apgoucher

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 | 3 Comments

Five-input Boolean circuits

Posted on May 28, 2019 by apgoucher

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