|
Volumn , Issue , 1998, Pages 227-234
|
Complexity of query reliability
a
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
MATHEMATICAL MODELS;
POLYNOMIALS;
PROBABILITY;
PROBLEM SOLVING;
RANDOM PROCESSES;
RELATIONAL DATABASE SYSTEMS;
CONJUNCTIVE QUERIES;
METAFINITE DATABASE MODELS;
POLYNOMIAL-TIME EVALUABLE QUERIES;
QUANTIFIER-FREE QUERIES;
QUERY LANGUAGES;
|
EID: 0031644039
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (52)
|
References (13)
|