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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Fractional-slot concentrated-winding (FSCW) synchronous permanent magnet (PM) machines have been gaining interest over the last… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We have developed software bots that inhabit the popular online social environment SecondLife (SL). Our bots can wander around… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
An ambulatory gait analysis method using body-attached gyroscopes to estimate spatio-temporal parameters of gait has been… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We tested the hypothesis that hydraulic conductance per unit leaf surface area of plant shoots (K SL) determines the maximum… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We present a new synchronous programming language named SL based on Esterel, in which hypothesis about signal presences or… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
nursing students? J Nurs Educ. 2004;43(7):305-312. [PMID: 15303583] 2. Figley CR, ed. Compassion Fatigue: Coping With Secondary… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A new large signal model for HEMT’s and MESFET’s, capable of ,modeling the current-voltage characteristic and its derivatives… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 6
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexity… (More)
Is this relevant?
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… (More)
Is this relevant?