CC
2008
Springer
13 years 10 months ago
2008
Springer
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 ...
CC
2008
Springer
13 years 11 months ago
2008
Springer
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...
CC
2008
Springer
13 years 11 months ago
2008
Springer
CC
2008
Springer
13 years 11 months ago
2008
Springer
CC
2008
Springer
13 years 11 months ago
2008
Springer
CC
2008
Springer
13 years 11 months ago
2008
Springer
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...
CC
2008
Springer
13 years 11 months ago
2008
Springer
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...
CC
2008
Springer
13 years 11 months ago
2008
Springer
We use derandomization to show that sequences of positive pspace-dimension
CC
2008
Springer
14 years 19 days ago
2008
Springer
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...
CC
2008
Springer
14 years 25 days ago
2008
Springer
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...