NL-Complete
CHF 39.40
Auf Lager
SKU
72L5K6NDTKH
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Mi., 15.10.2025 und Do., 16.10.2025
Details
High Quality Content by WIKIPEDIA articles! In computational complexity theory, NL-Complete is a complexity class which is complete for NL. It contains the most "difficult" or "expressive" problems in NL. If a method exists for solving any one of the NL-complete problems in logarithmic memory space, then NL=L. One important NL-complete problem is ST-connectivity (or "Reachability") (Papadimitriou 1994 Thrm. 16.2), the problem of determining whether, given a directed graph G and two nodes s and t on that graph, there is a path from s to t. ST-connectivity can be seen to be in NL, because we start at the node s and nondeterministically walk to every other reachable node. ST-connectivity can be seen to be NL-hard by considering the computation state graph of any other NL algorithm, and considering that the other algorithm will accept if and only if there is a (nondetermistic) path from the starting state to an accepting state.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131988691
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- EAN 9786131988691
- Titel NL-Complete
- Herausgeber Betascript Publishing
- Anzahl Seiten 76
- Genre Informatik
Bewertungen
Schreiben Sie eine Bewertung
