Posted: 21 May 2007

The paper

Arithmetizing Classes arround NC1 and L

Nutan Limaye and Meena Mahajan and B. V. Raghavendra Rao.
Proceedings of 24th International Symposium on Theoretical Aspects of Computer Science STACS, 22-24 Feb 2007, Aachen (Germany). Springer-Verlag Lecture Notes in Computer Science series Volume 4393.

has a flaw. The claim that #BP-NFA equals #BP-VPA may not be true; the construction in the paper is certainly incorrect. See a detailed Erratum here.

Having seen the erratum notice, now you may download the paper itself (conference version): Arithmetizing Classes arround NC1 and L

Update: 11 July 2007

A full version revising the above paper is now available. Regarding the erroneous proof, we show in this version that #BP-VPA is in FLogDCFL, while for any constant k, #BP-VPA mod k is in L.