by Betascript Publishing
VAT included - FREE Shipping
Do you like this product? Spread the word!
$31.86 incl. VAT
Only 1 items available Only 1 items available
Check other buying options
1 Offer for $32.97
Sold by Dodax
$32.97 incl. VAT
Delivery: between Wednesday, August 4, 2021 and Friday, August 6, 2021
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.
Number of Pages: