Separating the complexity classes NL and NP
Computational Complexity
2007-05-23 v2
Authors:
David B. Benson
Abstract
Withdrawn since -order- was overlooked. First order reductions without order are much too weak to separate.
Cite
@article{arxiv.cs/0004009,
title = {Separating the complexity classes NL and NP},
author = {David B. Benson},
journal= {arXiv preprint arXiv:cs/0004009},
year = {2007}
}
Comments
Withdrawn
Related papers
View all related →
Computational Complexity · Computer Science
NP is not AL and P is not NC is not NL is not L
Koji Kobayashi
2011-11-22
Machine Learning · Computer Science
Modularity as a Means for Complexity Management in Neural Networks Learning
David Castillo-Bolado, Cayetano Guerra-Artal, Mario Hernandez-Tejera
2019-02-26
Logic · Mathematics
We must know -- We shall know
Jacob Zimbarg Sobrinho
2020-04-21
Computational Complexity · Computer Science
On Canonical Forms of Complete Problems via First-order Projections
Nerio Borges, Blai Bonet
2007-06-26
Discrete Mathematics · Computer Science
On the relationship between classes P and NP
Anatoly D. Plotnikov
2016-03-03
Logic in Computer Science · Computer Science
A Note on the NP-Hardness of PARTITION Via First-Order Projections
Paúl Risco Iturralde
2025-12-29
Group Theory · Mathematics
Inverse monoids associated with the complexity class NP
J. C. Birget
2017-03-08
Computational Complexity · Computer Science
A Solution to the P versus NP Problem
Frank Vega Delgado
2014-07-08
Computational Complexity · Computer Science
NP - P is not empty
Marius Constantin Ionescu
2016-09-27
Computational Complexity · Computer Science
Relativizing Small Complexity Classes and their Theories
Klaus Aehlig, Stephen Cook, Phuong Nguyen
2012-04-26
Computational Complexity · Computer Science
P vs. NP
Daniel Uribe
2025-05-09
Discrete Mathematics · Computer Science
First-order interpretations of bounded expansion classes
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez +3
2018-10-08
Machine Learning · Computer Science
Neural eliminators and classifiers
Włodzisław Duch, Rafał Adamczak, Yoichi Hayashi
2019-01-29
Logic in Computer Science · Computer Science
Counting of Teams in First-Order Team Logics
Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer +1
2021-01-01
Computational Complexity · Computer Science
Complexity Classes as Mathematical Axioms
M. Freedman
2009-06-17
Logic · Mathematics
Reducts of structures and maximal-closed permutation groups
Manuel Bodirsky, Dugald Macpherson
2015-02-27
Computational Complexity · Computer Science
A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions
Christian Glasser, Lane A. Hemaspaandra
2007-05-23
Optimization and Control · Mathematics
Complexity and performance for two classes of noise-tolerant first-order algorithms
S. Gratton, S. Jerad, Ph. L. Toint
2025-01-30
Computational Complexity · Computer Science
Some structural complexity results for $\exists\mathbb R$
Klaus Meer, Adrian Wurm
2025-02-04
Logic in Computer Science · Computer Science
Relativisation makes contradictions harder for Resolution
Stefan Dantchev, Barnaby Martin
2014-10-30
General Relativity and Quantum Cosmology · Physics
Some Mathematical And Numerical Questions Connected With First And Second Order Time Dependent Systems Of Partial Differential Equations
Heinz-O. Kreiss, Omar E. Ortiz
2007-05-23
Artificial Intelligence · Computer Science
Description Logics with Abstraction and Refinement
Carsten Lutz, Lukas Schulze
2023-10-23
Optimization and Control · Mathematics
The complexity of first-order optimization methods from a metric perspective
Adrian S. Lewis, Tonghua Tian
2023-05-08
Logic · Mathematics
Arithmetic complexity via effective names for random sequences
Bjørn Kjos-Hanssen, Frank Stephan, Jason R. Teutsch
2014-08-14
Other Computer Science · Computer Science
P vs NP Problem in the field anthropology
Michael A. Popov
2009-04-21