Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 46
Number of items: 46
  • Buhrman, H., & Torenvliet, L. (1998). Randomness is hard. In Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity : June 15-18, 1998, Buffalo, New York, USA (pp. 249-260). IEEE Computer Society. https://doi.org/10.1109/CCC.1998.694616
  • Fischer, S., Hemaspaandra, L., & Torenvliet, L. (1997). Witness-isomorphic reductions and local search. In A. Sorbi (Ed.), Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics (pp. 207-223).
  • Buhrman, H. M., Fortnow, L., & Torenvliet, L. (1997). Six hypotheses in search of a theorem. In Proceedings of the 12th IEEE Conference on Computational Complexity (pp. 2-12). IEEE.
  • Buhrman, H. M., & Torenvliet, L. (1996). Complete sets and structure in sub-recursive classes. In Logic Colloquium 96: European Summer Meeting of the Association for Symbolic Logic (pp. 59-64)
  • Hemaspaandra, L., & Torenvliet, L. (1996). Optimal advice. Theoretical Computer Science, 154(2), 367-377. https://doi.org/10.1016/0304-3975(95)00076-3
  • Open Access
    Buhrman, H. M., & Torenvliet, L. (1996). P-selective self-reducible sets: A new characterization of P. Journal of Computer and System Sciences, 53(2), 210-217. https://doi.org/10.1006/jcss.1996.0062
  • Trautwein, M. H., & Torenvliet, L. (1995). A Note on the Complexity of Restricted Attribute Value Grammars. In Proceedings CLIN V (pp. 145-164)
  • Trautwein, M. H. (1995). Computational pitfalls in tractable grammatical formalisms. [Thesis, fully internal, Universiteit van Amsterdam].
  • Fischer, S. T. (1995). The solution sets of local search problems. [Thesis, fully internal, Universiteit van Amsterdam].
  • Fischer, S. T., Hemaspaandra, L., & Torenvliet, L. (1995). Witness-Isomorphic Reductions and the Local Search Problem. In Proceedings of MFCS 95, Springer Lecture Notes 969 (pp. 277-287)
Page 4 of 5