SL (計算複雑性理論)
1. SL (complexity)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.
Read “SL (complexity)” on English Wikipedia
Read “SL (計算複雑性理論)” on Japanese Wikipedia
Read “SL (complexity)” on DBpedia
Read “SL (complexity)” on English Wikipedia
Read “SL (計算複雑性理論)” on Japanese Wikipedia
Read “SL (complexity)” on DBpedia
Discussions
Log in to talk about this word.