@inproceedings{Roversi:1999-CSL,
  volume = {1683},
  month = {September},
  author = {Roversi, Luca},
  series = {Lecture Notes in Computer Science},
  booktitle = {Ninth Annual Conference of the EACSL (CSL'99)},
  url = {http://www.di.unito.it/~rover/RESEARCH/PUBLICATIONS/1999-CSL/Roversi1999CSL.ps.gz},
  address = {Madrid (Spain)},
  title = {{A} {P}-{T}ime {C}ompleteness {P}roof for {L}ight {L}ogics},
  abstract = {We explain why the original proofs of P-Time completeness for
              Light Affine Logic and Light Linear Logic can not work, and we
              fully develop a working one.},
  copyrightspringer = {http://www.springer.de/comp/lncs/index.html},
  publisher = {Springer-Verlag},
  year = {1999},
  pages = {469 -- 483},
}

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)