A fast APL algorithm for logic minimization
Alfred A. Schwartz · ACM SIGAPL APL Quote Quad · 1984
This paper presents an algorithm for logic reduction which exploits APL's array and Boolean processing capabilities. The traditional algorithm, the Quine-McCluskey method, requires extensive looping and hence is very slow when implemented in an interpretive language. The APL algorithm accomplishes the same function as the Quine-McCluskey method, but in a totally different way and much faster.