All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size (Q2379954)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size |
scientific article |
Statements
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size (English)
0 references
24 March 2010
0 references
theory of computation
0 references
formal languages
0 references
Turing machine
0 references
NP-language
0 references
evolutionary processor
0 references
0 references
