What Is a hard instance of a computational problem?

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

doi:10.1007/3-540-16486-3_99

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 proceeding › Conference contribution › Scientific › peer-review

Original language	English
Title of host publication	Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, June 2-5, 1986
Editors	Alan L. Selman
Pages	197-217
Number of pages	21
DOIs	https://doi.org/10.1007/3-540-16486-3_99
Publication status	Published - 1986
MoE publication type	A4 Article in a conference publication

Access to Document

10.1007/3-540-16486-3_99

http://dx.doi.org/10.1007/3-540-16486-3_99

Cite this

@inproceedings{4853c70db706475491a9081e67b53516,

title = "What Is a hard instance of a computational problem?",

author = "Ker-I Ko and Pekka Orponen and Uwe Sch{\"o}ning and Osamu Watanabe",

year = "1986",

doi = "10.1007/3-540-16486-3_99",

language = "English",

isbn = "3-540-16486-3",

pages = "197--217",

editor = "Selman, {Alan L.}",

booktitle = "Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, June 2-5, 1986",

}

What Is a hard instance of a computational problem? / Ko, Ker-I; Orponen, Pekka; Schöning, Uwe; Watanabe, Osamu.

Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, June 2-5, 1986. ed. / Alan L. Selman. 1986. p. 197-217.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review