ScholarLens Back to search
2016•Communications in computer and information scienceRequires access

Solving NP-complete Problems in Polynomial Time by Using a Natural Computing Model

Bogdan Aman, Gabriel Ciobanu

Open publisher page 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: Turing machine, PSPACE, Membrane computing, Computer science, Time complexity, Logarithm, P versus NP problem, Polynomial

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Solving NP-complete Problems in Polynomial Time by Using a Natural Computing Model — Research Paper | ScholarLens