NL (complexity)

Known as: NL (complexity theory), Nondeterministic logarithmic space, NL (complexity class) 
In computational complexity theory, NL (Nondeterministic Logarithmic-space) is the complexity class containing decision problems which can be solved… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Self-determination theory (SDT) is a macro theory of human motivation that evolved from research on intrinsic and extrinsic… (More)
  • figure 1
Is this relevant?
Review
2017
Review
2017
Emerging technologies, such as the Internet of Things, smart applications, smart grids, and machine-to-machine networks stimulate… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Interferometric synthetic aperture radar (SAR) data provide reflectivity, interferometric phase, and coherence images, which are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table I
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Adaptation is a process of deliberate change in anticipation of or in reaction to external stimuli and stress. The dominant… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
A limited diversity of character states for reproductive traits and a robust phylogeny make scleractinian corals an ideal model… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The global carbon budget is, of course, balanced. The conservation of carbon and the first law of thermodynamics are intact… (More)
  • figure 1
  • figure 3
  • table 2
  • 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
1995
Highly Cited
1995
Call a random partition of the positive integers partially exchangeable if for each finite sequence of positive integers n l… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, NP, and… (More)
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?