Sciweavers

172 search results - page 17 / 35
» The Complexity of Unions of Disjoint Sets
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook
MST
2006
99views more  MST 2006»
13 years 7 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
IPMU
2010
Springer
14 years 14 days ago
Plateau Regions: An Implementation Concept for Fuzzy Regions in Spatial Databases and GIS
Abstract. Many geographical applications need to model spatial phenomena with vague or indeterminate boundaries and interiors. A popular paradigm adopted by the GIS community for t...
Virupaksha Kanjilal, Hechen Liu, Markus Schneider
ICDT
2009
ACM
173views Database» more  ICDT 2009»
14 years 8 months ago
Containment of conjunctive queries on annotated relations
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positiv...
Todd J. Green
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
13 years 11 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...