On NP-completeness for linear machines (Q1368835)
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 1069068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On NP-completeness for linear machines |
scientific article; zbMATH DE number 1069068 |
Statements
On NP-completeness for linear machines (English)
0 references
1 October 1997
0 references
Blum-Shub-Smale model of computation
0 references
complexity classes
0 references
0.8034977316856384
0 references
0.8032762408256531
0 references
0.7861841917037964
0 references
