Hauptvortrag: The complexity of negation-limited networks - A brief survey

Michael J. Fischer. Hauptvortrag: The complexity of negation-limited networks - A brief survey. In H. Barkhage, editor, Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975. Volume 33 of Lecture Notes in Computer Science, pages 71-82, Springer, 1975.

@inproceedings{Fischer75,
  title = {Hauptvortrag: The complexity of negation-limited networks - A brief survey},
  author = {Michael J. Fischer},
  year = {1975},
  tags = {survey},
  researchr = {https://researchr.org/publication/Fischer75},
  cites = {0},
  citedby = {0},
  pages = {71-82},
  booktitle = {Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975},
  editor = {H. Barkhage},
  volume = {33},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-07407-4},
}