CC
2005
Springer
13 years 4 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
CC
2005
Springer
13 years 4 months ago
2005
Springer
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...
CC
2005
Springer
13 years 4 months ago
2005
Springer
CC
2005
Springer
13 years 7 months ago
2005
Springer
CC
2005
Springer
13 years 7 months ago
2005
Springer
Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques ar...
CC
2005
Springer
13 years 10 months ago
2005
Springer
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
CC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
CC
2005
Springer
13 years 10 months ago
2005
Springer
CC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present techniques that enable source-level debugging for multiple languages at the cost of only modest programming effort. The key idea is to avoid letting debugging ...
CC
2005
Springer
13 years 10 months ago
2005
Springer
