Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,003,237 papers from all fields of science
Search
Sign In
Create Free Account
SL (complexity)
Known as:
Symmetric Logspace
, USTCON
, Undirected reachability problem
Expand
In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
Advice (complexity)
Boolean satisfiability problem
Breadth-first search
Complement (complexity)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Symmetric Cross Entropy for Robust Learning With Noisy Labels
Yisen Wang
,
Xingjun Ma
,
Zaiyi Chen
,
Yuan Luo
,
Jinfeng Yi
,
J. Bailey
IEEE International Conference on Computer Vision
2019
Corpus ID: 201070534
Training accurate deep neural networks (DNNs) in the presence of noisy labels is an important and challenging task. Though a…
Expand
Highly Cited
2015
Highly Cited
2015
A social learning particle swarm optimization algorithm for scalable optimization
Ran Cheng
,
Yaochu Jin
Information Sciences
2015
Corpus ID: 17287006
Highly Cited
2011
Highly Cited
2011
A Meta-Analysis of the Impact of Service-Learning on Students
Christine I. Celio
,
J. Durlak
,
Allison B. Dymnicki
2011
Corpus ID: 11537949
Service-learning (SL) has become a popular teaching method everywhere from elementary schools to colleges. Despite the increased…
Expand
Highly Cited
2010
Highly Cited
2010
Fractional-Slot Concentrated-Windings Synchronous Permanent Magnet Machines: Opportunities and Challenges
A. El-Refaie
IEEE transactions on industrial electronics…
2010
Corpus ID: 27321687
Fractional-slot concentrated-winding (FSCW) synchronous permanent magnet (PM) machines have been gaining interest over the last…
Expand
Highly Cited
2007
Highly Cited
2007
Semi-Supervised Graph-Based Hyperspectral Image Classification
Gustau Camps-Valls
,
T. Marsheva
,
Dengyong Zhou
IEEE Transactions on Geoscience and Remote…
2007
Corpus ID: 15106876
This paper presents a semi-supervised graph-based method for the classification of hyperspectral images. The method is designed…
Expand
Highly Cited
2006
Highly Cited
2006
Trust network analysis with subjective logic
A. Jøsang
,
Ross Hayward
,
Simon Pope
Australasian Computer Science Conference
2006
Corpus ID: 6221184
Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a…
Expand
Highly Cited
1993
Highly Cited
1993
An Energetic Model of Microhabitat Use for Rainbow Trout and Rosyside Dace
Jennifer. Hill
,
G. Grossman
1993
Corpus ID: 73558625
We constructed an energetic model to determine the optimal focal point current velocity (i.e., microhabitat) for rainbow trout…
Expand
Highly Cited
1986
Highly Cited
1986
Checkpointing and Rollback-Recovery for Distributed Systems
R. Koo
,
S. Toueg
IEEE Transactions on Software Engineering
1986
Corpus ID: 206777989
We consider the problem of bringing a distributed system to a consistent state after transient failures. We address the two…
Expand
Highly Cited
1979
Highly Cited
1979
Random walks, universal traversal sequences, and the complexity of maze problems
R. Aleliunas
,
R. Karp
,
R. Lipton
,
L. Lovász
,
C. Rackoff
20th Annual Symposium on Foundations of Computer…
1979
Corpus ID: 18719861
It is well known that the reachability problem for directed graphs is logspace-complete for the complexity class NSPACE(log n…
Expand
Highly Cited
1971
Highly Cited
1971
Linear Resolution with Selection Function
R. Kowalski
,
D. Kuehner
Artificial Intelligence
1971
Corpus ID: 12182635
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required