On the complexity of non-unique probe selection (Q2474080)
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: On the complexity of non-unique probe selection |
scientific article; zbMATH DE number 5242697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of non-unique probe selection |
scientific article; zbMATH DE number 5242697 |
Statements
On the complexity of non-unique probe selection (English)
0 references
5 March 2008
0 references
non-unique probe selection
0 references
separable matrices
0 references
DP-complete
0 references
\(\Sigma _2^{\text{P}}\)-complete
0 references
0.9292884
0 references
0.8804713
0 references
0.8329286
0 references
0 references
0 references
0.8303112
0 references
0 references
0 references
