Sciweavers

CC
2005
Springer
118views System Software» more  CC 2005»
13 years 5 months ago
The complexity of constructing pseudorandom generators from hard functions
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...
Emanuele Viola
CC
2005
Springer
103views System Software» more  CC 2005»
13 years 5 months ago
Valiant's model and the cost of computing integers
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...
Pascal Koiran
CC
2005
Springer
13 years 5 months ago
On the complexity of computing determinants
Erich Kaltofen, Gilles Villard
CC
2005
Springer
13 years 7 months ago
When Abstraction Fails
Andreas Zeller
CC
2005
Springer
195views System Software» more  CC 2005»
13 years 7 months ago
Compilation of Generic Regular Path Expressions Using C++ Class Templates
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...
Luca Padovani
CC
2005
Springer
153views System Software» more  CC 2005»
13 years 11 months ago
Completeness Analysis for Incomplete Object-Oriented Programs
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...
Jingling Xue, Phung Hua Nguyen
CC
2005
Springer
115views System Software» more  CC 2005»
13 years 11 months ago
Experiences with Enumeration of Integer Projections of Parametric Polytopes
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...
Sven Verdoolaege, Kristof Beyls, Maurice Bruynoogh...
CC
2005
Springer
106views System Software» more  CC 2005»
13 years 11 months ago
Source-Level Debugging for Multiple Languages with Modest Programming Effort
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 ...
Sukyoung Ryu, Norman Ramsey