NP=NL and, therefore, P=NP as long as the polynomial upper bound is explicitly known for each language A in NP
Sergey V. YakhontovPublished in: CoRR (2012)
Keyphrases
- upper bound
- natural language
- computational complexity
- lower bound
- np hard
- formal language
- np complete
- linguistic knowledge
- worst case
- data sets
- language understanding
- natural language processing
- programming language
- branch and bound algorithm
- upper and lower bounds
- double exponential
- search algorithm
- artificial intelligence
- neural network