Sciweavers

Share
CC
2008
Springer
150views System Software» more  CC 2008»
8 years 2 months ago
Balancing Syntactically Multilinear Arithmetic Circuits
In their seminal paper, Valiant, Skyum, Berkowitz and Rackoff proved that arithmetic circuits can be balanced [VSBR]. That is, [VSBR] showed that for every arithmetic circuit of ...
Ran Raz, Amir Yehudayoff
CC
2008
Springer
133views System Software» more  CC 2008»
8 years 3 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets
CC
2008
Springer
165views System Software» more  CC 2008»
8 years 3 months ago
2-Local Random Reductions to 3-Valued Functions
Aduri Pavan, N. V. Vinodchandran
CC
2008
Springer
131views System Software» more  CC 2008»
8 years 3 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand
CC
2008
Springer
8 years 3 months ago
The Strength of Multilinear Proofs
We introduce an algebraic proof system that manipulates multilinear arithmetic formulas. We show that this proof system is fairly strong, even when restricted to multilinear arith...
Ran Raz, Iddo Tzameret
CC
2008
Springer
118views System Software» more  CC 2008»
8 years 3 months ago
Dimension Characterizations of Complexity Classes
We use derandomization to show that sequences of positive pspace-dimension
Xiaoyang Gu, Jack H. Lutz
CC
2008
Springer
240views System Software» more  CC 2008»
8 years 5 months ago
Hardware JIT Compilation for Off-the-Shelf Dynamically Reconfigurable FPGAs
JIT compilation is a model of execution which translates at run time critical parts of the program to a low level representation. Typically a JIT compiler produces machine code fro...
Etienne Bergeron, Marc Feeley, Jean-Pierre David
CC
2008
Springer
172views System Software» more  CC 2008»
8 years 5 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
books