Portland State University. Department of Electrical Engineering
Date of Award
Master of Science (M.S.) in Electrical and Computer Engineering
1 online resource (258 p.)
Parallel processing (Electronic computers), Computer architecture
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.
Ho, Phuong Minh, "Parallel architectures for solving combinatorial problems of logic design" (1989). Dissertations and Theses. Paper 3872.