Aristotle University Of Thessaloniki (AUTH)
ΜΕΛΕΤΗ ΨΕΥΔΟΜΠΟΥΛΙΑΝΩΝ ΑΝΙΣΟΕΞΙΣΩΣΕΩΝ ΚΑΙ ΣΥΣΤΗΜΑΤΩΝ
Abstract
dc:descriptionIN THIS THESIS, NOTIONS OF PSEUDO-BOOLEAN ALGEBRA ARE STUDIED WHICH DEAL WITH NONLINEAR PSEUDO-BOOLEAN EQUATION AND INEQUALITY. THREE ALGORITHMS OF IMPLICIT ENUMERATION TYPE ARE DEVELOPED WHICH CREATE THE FAMILY OF SOLUTION OF THESE PROBLEMS. THESE ARE EXPONENTIAL TIME COMPLEXITY PROBLEMS AND FOR THEIR EFFECTIVE RESOLUTION, IT IS NECESSARY TO DEVELOP POWERFUL BOUND CONDITIONS IN THE VERTICES OF THE SEARCHING TREE. IN ORDER TO SOLVE THE LINEAR PSEUDO-BOOLEAN EQUATION (INEQUALITY) THE EQUIVALENT LINEAR EQUATION (INEQUALITY) IS USED. WITH THE AID OF AN APPROPRIATE SOLUTIONS' SUBSET OF THE LATTER EQUATION, SYSTEMS OF BOOLEAN EQUATIONS ARE DEVELOPED THAT LEAD TO THE SOLUTIONS' FAMILIES. THREE THEOREMS ARE STATED ON WHICH IS BASED THE EFFECTIVENESS OF THE USED BOUND CONDITIONS OF THE PROPOSED ALGORITHMS. FINALLY, FOR AN EVALUATION OF THE ALGORITHMS' EFFECTIVENESS, A LARGE NUMBER OF PROBLEMS OF DIFFERENT CATEGORIES HAS BEEN SOLVED TO THE EXTENT OF 2000 VARIABLES GIVING VERY SATISFACTORY RESULTS.
Degree
thesis:*- Grantor dc:publisher
- Aristotle University Of Thessaloniki (AUTH)
- Year dc:date
- 1992
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Συνεφάκη-Αραμπατζή, Ασπασία
Subjects
dc:subject × 12Rights
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/2064