The calculation of an exact minimal cover of a Boolean function is an JVP-complete problem, which has an important application in circuit design. The required time for the calculation could be reduced by a factor of more than 3.5 * 10~7 in and even 8 * 10~8 in. In this paper we give a introduction into the definition of this problem and its basic solution. The main contribution of this paper are algorithms which enlarge the improvement factor mentioned above on this very high level for 32 variables p_i and 1024 clauses furthermore to 1.8 * 10~(10) using a single CPU-core and finally 1.2 * 10~(11) using a GPU.
展开▼
