The complexity of analog computation (Q1077163)
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: The complexity of analog computation |
scientific article; zbMATH DE number 3956438
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of analog computation |
scientific article; zbMATH DE number 3956438 |
Statements
The complexity of analog computation (English)
0 references
1986
0 references
NP-complete problems
0 references
strong version of Church's thesis
0 references
3-SAT
0 references
analog computers
0 references
ordinary differential equations
0 references
spin glasses
0 references
combinatorial optimization
0 references
0 references
0.9451664
0 references
0.9234838
0 references
0.9197456
0 references
0.9131875
0 references
0 references
0 references
0.8992211
0 references
0.89437747
0 references
0.89128184
0 references
