Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets

Lane A. Hemachandra. Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets. In Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, editors, Algorithms, International Symposium SIGAL 90, Tokyo, Japan, August 16-18, 1990, Proceedings. Volume 450 of Lecture Notes in Computer Science, pages 221-231, Springer, 1990.

@inproceedings{Hemachandra90,
  title = {Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets},
  author = {Lane A. Hemachandra},
  year = {1990},
  researchr = {https://researchr.org/publication/Hemachandra90},
  cites = {0},
  citedby = {0},
  pages = {221-231},
  booktitle = {Algorithms, International Symposium SIGAL  90, Tokyo, Japan, August 16-18, 1990, Proceedings},
  editor = {Tetsuo Asano and Toshihide Ibaraki and Hiroshi Imai and Takao Nishizeki},
  volume = {450},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-52921-7},
}