All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size (Q2379954)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size |
scientific article; zbMATH DE number 5686401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size |
scientific article; zbMATH DE number 5686401 |
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
0.8551697134971619
0 references
0.8475877046585083
0 references
0.847149133682251
0 references
