All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size (Q5452560)
From MaRDI portal
scientific article; zbMATH DE number 5259390
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
