Posted: 21 May 2007 

<p>
The paper 
<h4>
      Arithmetizing Classes arround NC1 and L
      </h4>
      <a href=http://www.imsc.res.in/%7Enutan>Nutan Limaye</a> and
      Meena Mahajan and 
      <a href=http://www.imsc.res.in/%7Ebvrr>B. V. Raghavendra Rao</a>.<br>
      <em> Proceedings of 24th International Symposium on Theoretical
      Aspects of Computer Science STACS, 
      22-24 Feb 2007,  Aachen (Germany)</em>. 
      <a
      href="http://www.springer.de/comp/lncs/index.html">Springer-Verlag
      Lecture Notes in Computer Science</a> series Volume 4393. <br>
      <p></p>

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 <a
href="http://www.imsc.res.in/%7Emeena/papers/stacs07-erratum.pdf">
Erratum </a> here. 

<p>
Having seen the erratum notice, now you may download the paper itself
      (conference version):
      <a href="http://www.imsc.res.in/%7Emeena/papers/arithnc-stacs.pdf">
      Arithmetizing Classes arround NC1 and L
</a>

<hr>

<p>
Update: 11 July 2007

<p>
A <a href="http://www.imsc.res.in/~meena/papers/arithnc.pdf">full version</a> 
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.