Why Computational Complexity Requires Stricter Martingales. Hitchcock, J. M. & Lutz, J. H. In Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., & Conejo, R., editors, Automata, Languages and Programming, volume 2380, pages 549–560, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8–13, 2002
bibtex   
@INPROCEEDINGS{HL02,
  author = {Hitchcock, John M. and Lutz, Jack H.},
  title = {Why Computational Complexity Requires Stricter Martingales},
  booktitle = {Automata, Languages and Programming},
  year = {2002},
  editor = {Widmayer, Peter and Triguero, Francisco and Morales, Rafael and Hennessy,
	Matthew and Eidenbenz, Stephan and Conejo, Ricardo},
  volume = {2380},
  series = LNCS,
  pages = {549--560},
  address = {Berlin},
  publisher = {Springer},
  note = {29th International Colloquium, ICALP, M{\'{a}}laga, Spain, July 8--13,
	2002},
  keywords = {bib,cca}
}

Downloads: 0