5244 search results - page 238 / 1049 » Structural Complexity of AvgBPP |
245
click to vote
POPL
2003
ACM
16 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...
161
click to vote
ICFP
2007
ACM
16 years 5 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
124
click to vote
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
167
Voted
MIAR
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract. A main focus of statistical shape analysis is the description of variability of a population of geometric objects. In this paper, we present work in progress towards mode...
156
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...