16,346 reputation
564122
bio website stanford.edu/~rrwill
location California
age
visits member for 4 years, 2 months
seen 11 hours ago

algorithms/complexity extremist


Aug
22
answered Beigel-Tarui transformation of ACC cricuits
Aug
22
reviewed Approve suggested edit on Online version of All pair shortest path when path weights are updated
Aug
17
awarded  Yearling
Jun
22
comment Evaluation of bounded-depth circuits
Andras' question is indeed important. I thought about this question a couple of years ago and believe I concluded that $k(d)=d+1$ for both $AC^0$ and $TC^0$, using the appropriate input representation (which is crucial).
May
30
comment Is there an explanation for the difficulty of proving quadratic lower bounds for interesting NP problems?
The question of quadratic time lower bounds is relevant when you restrict the algorithms to have very little (e.g., polylog) space, or when you look at one-tape Turing machines (which have very restricted access to memory). But when memory is unrestricted, and memory access is unrestricted, the "real" question is whether there are super-linear time lower bounds for interesting NP problems, in any random-access computational model. (Grandjean proved some super-linear lower bounds for multitape Turing machines, but they rely on the structure of one-dimensional tapes.)
May
23
awarded  Nice Answer
May
22
answered Books/Lecture Notes on Parametrized Complexity
May
20
awarded  Nice Answer
Apr
7
awarded  Popular Question
Apr
4
comment What is the fastest known simulation of BPP using Las Vegas algorithms?
Hi Arul, luckily Bill Gasarch asked me this question a while back, and put up the following webpage of links: cs.umd.edu/~gasarch/ryan/ryan.html
Apr
2
comment What is the fastest known simulation of BPP using Las Vegas algorithms?
Not stupid at all -- indeed, $BPP \subseteq NTIME(2^{n^c})$ for some $c$ is enough for $BPP \neq NEXP$, thanks for pointing that out. Subexponential time algorithms are necessary for the other consequences, though.
Apr
2
awarded  Nice Answer
Apr
1
comment What is the fastest known simulation of BPP using Las Vegas algorithms?
Thanks to Niel for taking the time to make my response legible :)
Apr
1
revised What is the fastest known simulation of BPP using Las Vegas algorithms?
added 43 characters in body
Apr
1
answered What is the fastest known simulation of BPP using Las Vegas algorithms?
Mar
18
comment On $\mathcal L$, $\mathcal{N\!L}$, $\mathcal L^2$, $\mathcal P$ and $\mathcal{N\!P}$
@Kaveh We certainly know that UNIFORM $TC^0$ is different from $P^{\#P}$ -- cf. Allender's circuit lower bounds for the Permanent. (Uniform $TC^0$ is the version that is relevant to the present discussion.) But yes, even separating $NP$ from uniform-$TC^0$ is open.
Mar
7
awarded  Nice Answer
Mar
6
answered Can one return to a TCS research job after an excursion to a non-research industry job?
Mar
4
reviewed Approve suggested edit on Is the the spectral norm of a Boolean function bounded by the degree of its Fourier expansion?
Mar
4
reviewed Approve suggested edit on How can we derive this lower bound of a special cut in a graph?