An algorithm for converting neural networks into Boolean functions is
presented. The absence of such an algorithm has been identified in the
literature as a significant problem, and the solution shown in the pa
per is both complete and efficient. The analysis of the algorithm show
s it to have a time complexity of better than 2N-1 - 2(N/2)-1 + 1.