[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 whet... Found on http://en.wikipedia.org/wiki/SL_(complexity)
(PROJECT GLOSSARY) Short List: A list of pre-qualified suppliers who will receive an RTB derived from various sources. Found on https://www.encyclo.co.uk/local/20479