6266 search results - page 1 / 1254 » New results on the computability and complexity of points - ... |
POPL
2003
ACM
14 years 5 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
SOFSEM
2010
Springer
14 years 1 months ago
2010
Springer
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...