Filter
Conference contribution

Search results

  • 1986

    What Is a hard instance of a computational problem?

    Ko, K-I., Orponen, P., Schöning, U. & Watanabe, O., 1986, Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, June 2-5, 1986. Selman, A. L. (ed.). p. 197-217 21 p.

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

  • 1985

    Polynomial levelability and maximal complexity cores

    Orponen, P., Russo, D. A. & Schöning, U., 1985, Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings. Brauer, W. (ed.). p. 435-444 10 p.

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

  • 1984

    The structure of polynomial complexity cores (Extended abstract)

    Orponen, P. & Schöning, U., 1984, Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings. Chytil, M. & Koubek, V. (eds.). p. 452-458 7 p.

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

  • 1983

    Complexity classes of alternating machines with oracles

    Orponen, P., 1983, Automata, Languages and Programming: 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings. Díaz, J. (ed.). p. 573-584 12 p. (Lecture Notes in Computer Science; vol. 154).

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