Complexity Cores and Hard Problem Instances

Uwe Schöning. Complexity Cores and Hard Problem Instances. 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 232-240, Springer, 1990.

@inproceedings{Schoning90:0,
  title = {Complexity Cores and Hard Problem Instances},
  author = {Uwe Schöning},
  year = {1990},
  researchr = {https://researchr.org/publication/Schoning90%3A0},
  cites = {0},
  citedby = {0},
  pages = {232-240},
  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},
}