ScholarLens Back to search
2012•arXiv (Cornell University)Open access

NP=NL and, therefore, P=NP as long as the polynomial upper bound is explicitly known for each language A in NP

Sergey V. Yakhontov

Open full text 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Upper and lower bounds, Combinatorics, Mathematics, Polynomial, Mathematical analysis

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
NP=NL and, therefore, P=NP as long as the polynomial upper bound is explicitly known for each language A in NP — Research Paper | ScholarLens