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.
Valiant Vazirani Theorem
CHF 42.60
Auf Lager
SKU
JA58VGOHM2N
1 Verfügbar 
Geliefert zwischen Mi., 04.02.2026 und Do., 05.02.2026
Details
High Quality Content by WIKIPEDIA articles! The Valiant Vazirani theorem is an important result in computational complexity theory. It was proven by Leslie Valiant and Vijay Vazirani in their paper titled "NP is as easy as detecting unique solutions" published in 1986. The theorem states that if there is a polynomial time algorithm for UNIQUE-SAT, then NP=RP. The theorem implies that even if the number of satisfying assignments is very small, SAT (which is an NP-complete problem) still remains a hard problem. UNIQUE-SAT is a promise problem that decides whether a given Boolean formula is unsatisfiable or has exactly one satisfying assignment. In the first case a UNIQUE-SAT algorithm would reject, and in the second it would accept the formula. If the formula has more than one satisfying assignment then the behavior of the UNIQUE-SAT algorithm does not matter.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131122514
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131122514
- Format Fachbuch
- Titel Valiant Vazirani Theorem
- Herausgeber Betascript Publishing
- Anzahl Seiten 84
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
