On the complexity of data disjunctions. (Q1853503)
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 data disjunctions. |
scientific article; zbMATH DE number 1857042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of data disjunctions. |
scientific article; zbMATH DE number 1857042 |
Statements
On the complexity of data disjunctions. (English)
0 references
21 January 2003
0 references
Data disjunction
0 references
Deductive databases
0 references
Computational complexity
0 references
Complexity upgrading
0 references
Conversion lemma
0 references
0 references
0 references
0 references
0.86543274
0 references
0.8573277
0 references
0.8571423
0 references
0.85577583
0 references
0.85577583
0 references
0.8527857
0 references
0.84647614
0 references
0.84647614
0 references
