A method for minimizing partially defined Boolean functions

Most read articles by the same author(s)

• Gabor T. Herman, Zoltán M. Hantos, Lajos Klukovits, Imre Pávó, András Ádám, U. Kling, A. Máté, J. Szűcs, K. Bellmann, Michael Gössel, Ferenc Móricz, Dániel Muszka, Attila Sára, János Bagyinszki, György Révész, F. Ferenczy, András Pellionisz, Ferenc Forgó, Annamária G. Varga, Rózsa Péter, János Demetrovics, B. Papp, Pál Dömösi, Wilhelm Kämmerer, E. Vida, Lubomir Georgiev Iliev, Rezûm statej pervogo toma Acta Cybernetica , Acta Cybernetica: Vol. 1 No. 4 (1972)
• Péter Ecsedi-Tóth, A partial solution of the finite spectrum problem , Acta Cybernetica: Vol. 7 No. 2 (1985)
• Péter Ecsedi-Tóth, A. Varga, An effective theorem proving algorithm , Acta Cybernetica: Vol. 3 No. 3 (1977)
• Péter Ecsedi-Tóth, A theory of finite functions, part I. : on finite trees associated to certain finite functions , Acta Cybernetica: Vol. 6 No. 2 (1983)
• Péter Ecsedi-Tóth, L. Turi, On the number of zero order interpolants , Acta Cybernetica: Vol. 6 No. 4 (1984)
• Ferenc Móricz, On a minimization algorithm for Boolean functions , Acta Cybernetica: Vol. 1 No. 2 (1971)
• Péter Ecsedi-Tóth, Ferenc Móricz, A. Varga, A note on symmetric Boolean functions , Acta Cybernetica: Vol. 3 No. 4 (1977)