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

algorithms/complexity extremist


Apr
16
comment Approximating $\textrm{AC}^{0}$ by sparse polynomials
Yes, such sparse polynomials would resolve many open problems... :)
Mar
9
awarded  Nice Answer
Mar
9
awarded  Nice Answer
Feb
24
awarded  Nice Answer
Feb
22
answered What would be the consequences of PH=PSPACE?
Feb
19
awarded  Enlightened
Feb
19
awarded  Nice Answer
Feb
18
awarded  Good Answer
Jan
24
awarded  Constituent
Jan
14
awarded  Caucus
Jan
6
awarded  Citizen Patrol
Dec
23
answered Testing boolean vectors orthogonality with fast query-time
Dec
19
awarded  Nice Answer
Dec
4
comment Computational Model in SETH
Not quite. I fixed the quantifiers.
Dec
4
revised Computational Model in SETH
whoops on SETH
Dec
4
reviewed Reject suggested edit on Implemented code to compute pathwidth (= Node search number, vertex separation number, interval thickness)
Dec
4
reviewed Approve suggested edit on Major unsolved problems in theoretical computer science?
Dec
2
awarded  Enlightened
Dec
2
awarded  Nice Answer
Dec
1
answered Computational Model in SETH