All superlinear inverse schemes are coNP-hard (Q2575753)
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 superlinear inverse schemes are coNP-hard |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All superlinear inverse schemes are coNP-hard |
scientific article |
Statements
All superlinear inverse schemes are coNP-hard (English)
0 references
6 December 2005
0 references
Inverse problems
0 references
Certificates
0 references
coNP-hardness
0 references
NP
0 references
P-producible sets
0 references
Complexity theory
0 references
0.9992082118988036
0 references
0.7832180857658386
0 references
0.7788326144218445
0 references
0.7397834062576294
0 references
0.7358765602111816
0 references
