92 search results - page 1 / 19 » An Optimal Lower Bound on the Number of Variables for Graph ... |
FOCS
1989
IEEE
13 years 11 months ago
1989
IEEE
AAAI
2008
13 years 9 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
DAM
2007
13 years 6 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
STOC
1995
ACM
13 years 10 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...