1650 search results - page 68 / 330 » The HOM problem is decidable |
130
Voted
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
181
Voted
DLT
2009
15 years 1 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
149
click to vote
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
135
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
126
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...