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

Related topics

Related topics

50 relations
Advice (complexity)Book embeddingBoolean satisfiability problemCC (complexity)
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2001
Highly Cited
2001
Hash-based IP traceback
The design of the IP protocol makes it difficult to reliably identify the originator of an IP packet. Even in the absence of any… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Descriptive Complexity
Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The… (More)
  • figure 1.1
  • figure 1.11
  • table 1.19
  • figure 2.13
  • figure 2.21
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Relationships Among PL, #L, and the Determinant
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
An ISEE/Whistler model of equatorial electron density in the magnetosphere
An empirical model of equatorial electron density in the magnetosphere has been developed, covering the range 2.25 < L < 8… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Languages that Capture Complexity Classes
We present a series of operators of apparently increasing power which when added to first-order logic produce a series of… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Parallel Complexity of Logical Query Programs
We consider the parallel time complexity of logic programs without function symbols, called logical query programs, or Datalog… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Constraints on Supersymmetry Breaking
Abstract Some non-perturbative constraints on supersymmetry breaking are derived. It is demonstrated that dynamical supersymmetry… (More)
  • figure 3
  • figure 6
  • figure 9
  • figure 12
  • figure 14
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Random walks, universal traversal sequences, and the complexity of maze problems
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?
Highly Cited
1977
Highly Cited
1977
The Computational Complexity of Provability in Systems of Modal Propositional Logic
The computational complexity of the provability problem in systems of modal propositional logic is investigated. Every problem… (More)
  • figure 1
Is this relevant?
Highly Cited
1975
Highly Cited
1975
Visual control of flight behaviour in the hoverflySyritta pipiens L.
1. The visually guided flight behaviour of groups of male and femaleSyritta pipiens was filmed at 50 f.p.s. and analysed frame by… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?