# NL-complete

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- LICS
- 2016

Blondin et al. showed at LICS 2015 that two-dimensional vector addition systems with states have reachability witnesses of lengthâ€¦Â (More)

Is this relevant?

2015

2015

- ArXiv
- 2015

We investigate the complexity of a puzzle that turns out to be NLcomplete.Â

Is this relevant?

2011

2011

- Theor. Comput. Sci.
- 2011

We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use theseâ€¦Â (More)

Is this relevant?

2011

2011

- MFCS
- 2011

We prove that deciding language equivalence of deterministic realtime one-counter automata is NL-complete, in stark contrast toâ€¦Â (More)

Is this relevant?

2011

2011

- Int. J. Found. Comput. Sci.
- 2011

The hairpin completion is an operation on formal languages which is inspired by the hairpin formation in biochemistry. Hairpinâ€¦Â (More)

Is this relevant?

2011

2011

- Formal Methods in System Design
- 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

- 2008 23rd Annual IEEE Symposium on Logic inâ€¦
- 2008

The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that decidingâ€¦Â (More)

Is this relevant?

2008

2008

- 2008 15th IEEE International Conference on Imageâ€¦
- 2008

The Non-Local means (NL-means) algorithm was recently introduced and shown state of the art performance in image de-noisingâ€¦Â (More)

Is this relevant?

2007

2007

- CSL
- 2007

We provide a new correctness criterion for unit-free MLL proof structures and MELL proof structures with units. We prove thatâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Natural Language Engineering
- 1996

Â

Is this relevant?