On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees (Q407530)
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 coNP hardness of computing certain answers over locally specified incomplete DOM-trees |
scientific article; zbMATH DE number 6018471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees |
scientific article; zbMATH DE number 6018471 |
Statements
On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees (English)
0 references
27 March 2012
0 references
databases
0 references
incomplete information
0 references
certain answers
0 references
0.7762449383735657
0 references
0.7587963938713074
0 references
0.7503573894500732
0 references
0.7263612151145935
0 references
0.7229074835777283
0 references
