4-input 2-output Boolean circuits
Complex Projective 4-Space 2020-07-01
Summary:
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 →