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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
For 10,000 years pigs and humans have shared a close and complex relationship. From domestication to modern breeding practices… (More)
  • table 1
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
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
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
1998
Highly Cited
1998
We have built a server that provides linkage information for all pages indexed by the AltaVista search engine. In its basic… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
  • Edward Witten
  • 1982
ly, as being the operator which commutes with all elementary Bose fields and anticommutes with all elementary Fermi fields. In… (More)
  • figure 3
  • figure 6
  • figure 9
  • figure 12
  • figure 14
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?
Highly Cited
1977
Highly Cited
1977
The computational complexity of the provability problem in systems of modal proposi-tional logic is investigated. Every problem… (More)
  • figure 1
Is this relevant?
Highly Cited
1975
Highly Cited
1975
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?
Highly Cited
1974
Highly Cited
1974
The inherent computational complexity of a va r i e ty of decision problems i n mathematical logic and the theory of automata i s… (More)
  • table 4.2
Is this relevant?