TU Bergakademie Freiberg |
Fakultät für Mathematik und Informatik
|
3rd International Workshop Boolean Problems |
Abstracts
Development of Zakrevskij's Minimization Strategy
towards Arithmetical Polynomial Domain
G. Duecki1, G. Holowinski2, K Malecki2,
V. Shmerko3, S. Yanushkevich4
1) St. Francis Xavier Univ., Dept. of Math.
& Comp. Sci., Antigonish, B2G 2W5, CANADA,
e-mail: gdueck@stfx.ca
2) Inst.
of Comp. Sci. & Inf. Systems, Technical Univ., Szczecin, POLAND,
3,4) Inst. Of Comp. Sci. & Inf. Systems, Technical
Univ., Zolnierska Str. 49, 71210 Szczecin, POLAND, Fax: (+4891)
48 76 439,
e-mail:
shmerko@ii.tuniv.szczecin.pl / State Univ.
of Informatics &Radioelectronics, Minsk BELARUS
Abstract:
In this paper we study the possibility of using the called staircase
strategy, originally presented by Zakrevskij, for minimization
Boolean function in Arithmetical Polynomials forms. The results
on developing staircase minimization strategy to find a quasi-optimal
Arithmetical Polynomial forms for both completely and incompletely
specified Boolean functions is presented. The experimental results
for benchmarks and the comparison with well-nown minimization
strategies are discussed.
Inhalt:/ Content: Institut für Informatik
TU Bergakademie Freiberg
Gestaltung/ Layout: Webmaster
19. Oktober 1998