All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size (Q5452560)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5259390
| 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 Networks of Splicing Processors of Constant Size |
scientific article; zbMATH DE number 5259390 |
Statements
All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size (English)
0 references
4 April 2008
0 references
0.87416136
0 references
0.82239133
0 references
0 references
0.8081857
0 references
0.7968078
0 references
0.79532564
0 references
0.7920456
0 references
0.7916362
0 references
