Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

L (complexity)

Known as: L (disambiguation), Logarithmic space, Logspace 
In computational complexity theory, L (also known as LSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
We propose a new family of description logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages… Expand
  • figure 4
Highly Cited
2007
Highly Cited
2007
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Highly Cited
2001
Highly Cited
2001
We use a simple statistical analysis to impose one image's color characteristics on another. We can achieve color correction by… Expand
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Highly Cited
1999
Highly Cited
1999
  • N. Immerman
  • Graduate Texts in Computer Science
  • 1999
  • Corpus ID: 6916124
Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The… Expand
  • figure 1.1
  • figure 1.11
  • table 1.19
  • figure 2.13
  • figure 2.21
Highly Cited
1992
Highly Cited
1992
The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1992
Highly Cited
1992
An empirical model of equatorial electron density in the magnetosphere has been developed, covering the range 2.25 < L < 8… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1987
Highly Cited
1987
Solvation dynamics in polar liquids have been examined using the probe molecule coumarin 153 (Cu153) and picosecond spectroscopic… Expand
  • table I
  • figure 2
  • figure 1
  • table II
  • figure 3
Highly Cited
1982
Highly Cited
1982
Some non-perturbative constraints on supersymmetry breaking are derived. It is demonstrated that dynamical supersymmetry breaking… Expand
  • figure 3
  • figure 6
  • figure 9
  • figure 12
  • figure 14
Highly Cited
1978
Highly Cited
1978
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand
Highly Cited
1966
Highly Cited
1966
  • S. Golomb
  • IEEE Trans. Inf. Theory
  • 1966
  • Corpus ID: 206728952
explicitly evaluable functions. For example, the M-ary error probability is expressed as a quadrature in Lindsey's equation (17… Expand
  • table I
  • table II