What Is a hard instance of a computational problem?

Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Original languageEnglish
Title of host publicationStructure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, June 2-5, 1986
EditorsAlan L. Selman
Pages197-217
Number of pages21
DOIs
Publication statusPublished - 1986
MoE publication typeA4 Article in a conference publication

Cite this