SNP (Complexity)
CHF 39.85
Auf Lager
SKU
L10ENS1IQD4
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Mi., 15.10.2025 und Do., 16.10.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logical characterization in terms of graph-theoretical properties. It forms the basis for the definition of the class MaxSNP of optimization problems. One characterization of the complexity class NP, shown by Ronald Fagin in 1974 and related to Fagin''s theorem, is that it is the set of problems that can be reduced to properties of graphs expressible in existential second-order logic. This logic allows universal ( ) and existential ( ) quantification over vertices, but only existential quantification over sets of vertices and relations between vertices. SNP retains existential quantification over sets and relations, but only permits universal quantification over vertices.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131244827
- Genre Technik
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Anzahl Seiten 76
- Herausgeber Betascript Publishing
- Größe H220mm x B220mm
- EAN 9786131244827
- Format Fachbuch
- Titel SNP (Complexity)
Bewertungen
Schreiben Sie eine Bewertung
