16666 search results - page 2759 / 3334 » Descriptive and Computational Complexity |
188
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
172
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
353
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
188
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
279
click to vote
VLDB
2002
ACM
16 years 7 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...