1552 search results - page 47 / 311 » On the Complexity of Constant Propagation |
124
click to vote
COCO
2004
Springer
15 years 5 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
140
click to vote
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
113
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
116
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
110
click to vote
PLDI
1996
ACM
15 years 6 months ago
1996
ACM
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...