186 search results - page 7 / 38 » Exceptional planar polynomials |
MST
2007
13 years 7 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
NA
2007
13 years 7 months ago
2007
GC-sets are subsets T of Rd of cardinality dim Πn for which, for each τ ∈ T, there are n hyperplanes whose union contains all of T except for τ, thus making interpolation to a...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
PODS
2000
ACM
13 years 12 months ago
2000
ACM
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
STOC
1998
ACM
13 years 12 months ago
1998
ACM
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...