Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
Parallel Architectures For Solving Combinatorial Problems Of Logic Design, Phuong Minh Ho
Parallel Architectures For Solving Combinatorial Problems Of Logic Design, Phuong Minh Ho
Dissertations and Theses
This thesis presents a new, practical approach to solve various NP-hard combinatorial problems of logic synthesis, logic programming, graph theory and related areas. A problem to be solved is polynomially time reduced to one of several generic combinatorial problems which can be expressed in the form of the Generalized Propositional Formula (GPF) : a Boolean product of clauses, where each clause is a sum of products of negated or non-negated literals.