Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Petrick's Method
CHF 84.70
Auf Lager
SKU
BQ4S4P0C874
1 Verfügbar 
Geliefert zwischen Mo., 02.02.2026 und Di., 03.02.2026
Details
High Quality Content by WIKIPEDIA articles! In Boolean algebra, Petrick's method (also known as the branch-and-bound method) is a technique for determining all minimum sum-of-products solutions from a prime implicant chart. Petrick's method is very tedious for large charts, but it is easy to implement on a computer. 1. Reduce the prime implicant chart by eliminating the essential prime implicant rows and the corresponding columns. 2. Label the rows of the reduced prime implicant chart P1, P2, P3, P4, etc. 3. Form a logical function P which is true when all the columns are covered. P consists of a product of sums where each sum term has the form (Pi0 + Pi1 + cdots + PiN), where each Pij represents a row covering column i. 4. Reduce P to a minimum sum of products by multiplying out and applying X + XY = X. 5. Each term in the result represents a solution, that is, a set of rows which covers all of the minterms in the table.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131280108
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131280108
- Format Fachbuch
- Titel Petrick's Method
- Herausgeber Betascript Publishing
- Anzahl Seiten 260
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
