NL-complete

In computational complexity theory, NL-complete is a complexity class containing the languages that are complete for NL, the class of decision… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2018
051019852018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Blondin et al. showed at LICS 2015 that two-dimensional vector addition systems with states have reachability witnesses of length… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2015
2015
We investigate the complexity of a puzzle that turns out to be NLcomplete. 
Is this relevant?
2011
2011
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
We prove that deciding language equivalence of deterministic realtime one-counter automata is NL-complete, in stark contrast to… (More)
  • figure 3
  • figure 4
Is this relevant?
2011
2011
The hairpin completion is an operation on formal languages which is inspired by the hairpin formation in biochemistry. Hairpin… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
We propose a novel, sound, and complete Simplex-based algorithm for solving linear inequalities over integers. Our algorithm… (More)
Is this relevant?
2008
2008
The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
The Non-Local means (NL-means) algorithm was recently introduced and shown state of the art performance in image de-noising… (More)
  • figure 1
  • figure 2
Is this relevant?
2007
2007
We provide a new correctness criterion for unit-free MLL proof structures and MELL proof structures with units. We prove that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1996