6274 search results - page 141 / 1255 » From query complexity to computational complexity |
158
click to vote
ECCC
2010
15 years 2 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
126
click to vote
SIGCSE
2008
ACM
15 years 4 months ago
2008
ACM
The underlying processes that enable database query execution are fundamental to understanding database management systems. However, these processes are complex and can be difficu...
103
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
245
click to vote
GIS
2005
ACM
16 years 5 months ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
144
click to vote
ICEBE
2005
IEEE
15 years 9 months ago
2005
IEEE
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...