Parallel architectures for solving combinatorial problems of logic design
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 for...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
PDXScholar
1989
|
| Subjects: | |
| Online Access: | https://pdxscholar.library.pdx.edu/open_access_etds/3872 https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=4881&context=open_access_etds |