A summary and the conclusion of part I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 175)
Part I : A formalism and a computation method for the synthesis of algorithms
KeywordsBoolean Function Synthesis Scheme Duality Principle Optimal Implementation Duality Gate
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1984