172 search results - page 6 / 35 » The Complexity of Unions of Disjoint Sets |
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
COMPGEOM
2010
ACM
14 years 23 days ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
COMGEO
1998
ACM
13 years 7 months ago
1998
ACM
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
DAM
2008
13 years 7 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...