Portland State University. Department of Electrical Engineering
Date of Publication
Master of Science (M.S.) in Electrical and Computer Engineering
Parallel processing (Electronic computers), Computer architecture
1 online resource (258 p.)
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.
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Ho, Phuong Minh, "Parallel architectures for solving combinatorial problems of logic design" (1989). Dissertations and Theses. Paper 3872.