SL (Complexity)
CHF 37.15
Auf Lager
SKU
EOMR2NF09SV
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Do., 30.10.2025 und Fr., 31.10.2025
Details
High Quality Content by WIKIPEDIA articles! In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t connectivity), which is the problem of determining whether there exists a path between two vertices in an undirected graph, otherwise described as the problem of determining whether two vertices are in the same connected component. This problem is also called the undirected reachability problem. It does not matter whether many-one reducibility or Turing reducibility is used. Although originally described in terms of symmetric Turing machines, that equivalent formulation is very complex, and the reducibility definition is what is used in practice.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131168857
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131168857
- Format Fachbuch
- Titel SL (Complexity)
- Herausgeber Betascript Publishing
- Anzahl Seiten 68
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
