Polynomial Levelability and Maximal Complexity Cores

Pekka Orponen, David A. Russo, Uwe Schöning. Polynomial Levelability and Maximal Complexity Cores. In Wilfried Brauer, editor, Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings. Volume 194 of Lecture Notes in Computer Science, pages 435-444, Springer, 1985.

@inproceedings{OrponenRS85,
  title = {Polynomial Levelability and Maximal Complexity Cores},
  author = {Pekka Orponen and David A. Russo and Uwe Schöning},
  year = {1985},
  researchr = {https://researchr.org/publication/OrponenRS85},
  cites = {0},
  citedby = {0},
  pages = {435-444},
  booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings},
  editor = {Wilfried Brauer},
  volume = {194},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-15650-X},
}