Separating the complexity classes NL and NP

TL;DR

This paper discusses the limitations of first-order reductions without order in separating the complexity classes NL and NP, highlighting that such reductions are too weak for this purpose.

Contribution

It clarifies that first-order reductions without order cannot separate NL and NP, emphasizing the need for stronger reduction techniques.

Findings

First-order reductions without order are insufficient for separating NL and NP.

Order is crucial for the strength of reductions in complexity class separation.

The paper underscores the importance of considering order in reduction methods.

Abstract

Withdrawn since -order- was overlooked. First order reductions without order are much too weak to separate.