Skip to search formSkip to main contentSkip to account menu

SL (complexity)

Known as: Symmetric Logspace, USTCON, Undirected reachability problem 
In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Training accurate deep neural networks (DNNs) in the presence of noisy labels is an important and challenging task. Though a… 
Highly Cited
2011
Highly Cited
2011
Service-learning (SL) has become a popular teaching method everywhere from elementary schools to colleges. Despite the increased… 
Highly Cited
2010
Highly Cited
2010
  • A. El-Refaie
  • 2010
  • Corpus ID: 27321687
Fractional-slot concentrated-winding (FSCW) synchronous permanent magnet (PM) machines have been gaining interest over the last… 
Highly Cited
2007
Highly Cited
2007
This paper presents a semi-supervised graph-based method for the classification of hyperspectral images. The method is designed… 
Highly Cited
2006
Highly Cited
2006
Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a… 
Highly Cited
1993
Highly Cited
1993
We constructed an energetic model to determine the optimal focal point current velocity (i.e., microhabitat) for rainbow trout… 
Highly Cited
1986
Highly Cited
1986
We consider the problem of bringing a distributed system to a consistent state after transient failures. We address the two… 
Highly Cited
1979
Highly Cited
1979
It is well known that the reachability problem for directed graphs is logspace-complete for the complexity class NSPACE(log n… 
Highly Cited
1971