Image/logo of the organisation entitled Institute of Theoretical Computer Science

Institute of Theoretical Computer Science

Organisational unit: Institute

Type of address: Visitor address.
Appelstraße 9a
30167
Hannover
View graph of relations
141 - 160 out of 215Page size: 20

Publications

  1. 2010
  2. Published

    Counting classes and the fine structure between NC1 and L.

    Datta, S., Mahajan, M., Rao, B. V. R., Thomas, M. & Vollmer, H., 2010, In: Electronic colloquium on computational complexity (ECCC). TR10

    Research output: Contribution to journal › Article › Research › peer review

  3. Published

    Extensional Uniformity for Boolean Circuits

    McKenzie, P., Thomas, M. & Vollmer, H., 2010, In: SIAM J. Comput.. 39, 7, p. 3186-3206 21 p., 7.

    Research output: Contribution to journal › Article › Research › peer review

  4. Published

    On Second-Order Monadic Monoidal and Groupoidal Quantifiers

    Kontinen, J. & Vollmer, H., 2010, In: Log. Methods Comput. Sci.. 6, 3

    Research output: Contribution to journal › Article › Research › peer review

  5. Published

    Proof Complexity of Propositional Default Logic

    Beyersdorff, O., Meier, A., Müller, S., Thomas, M. & Vollmer, H., 2010, Theory and Applications of Satisfiability Testing: SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings. Strichman, O. & Szeider, S. (eds.). p. 30-43 14 p. (Lecture Notes in Computer Science; vol. 6175).

    Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review

  6. Published

    Proof Complexity of Propositional Default Logic

    Beyersdorff, O., Meier, A., Müller, S., Thomas, M. & Vollmer, H., 2010, In: Dagstuhl Seminar Proceedings (DSP). 10061

    Research output: Contribution to journal › Conference article › Research › peer review

  7. Published

    The Complexity of Problems for Quantified Constraints.

    Bauland, M., Böhler, E., Creignou, N., Reith, S., Schnoor, H. & Vollmer, H., 2010, In: Theory Comput. Syst.. 47, 2, p. 454-490

    Research output: Contribution to journal › Article › Research › peer review

  8. Published

    The Complexity of Reasoning for Fragments of Autoepistemic Logic

    Creignou, N., Meier, A., Thomas, M. & Vollmer, H., 2010, (Dagstuhl Seminar Proceedings).

    Research output: Working paper/Preprint › Technical report › Research

  9. Published

    The Complexity of Reasoning for Fragments of Autoepistemic Logic

    Creignou, N., Meier, A., Thomas, M. & Vollmer, H., 2010, (CoRR).

    Research output: Working paper/Preprint › Technical report › Research

  10. Published

    The Complexity of Reasoning for Fragments of Autoepistemic Logic∗

    Creignou, N., Meier, A., Thomas, M. & Vollmer, H., 2010, Dagstuhl Seminar: Circuits, Logic, and Games 2010. Vol. 10061. (Dagstuhl Seminar Proceedings).

    Research output: Chapter in book/report/conference proceeding › Contribution to other report › Research › peer review

  11. Published

    The complexity of satisfiability for fragments of hybrid logic - Part I.

    Meier, A., Mundhenk, M., Schneider, T., Thomas, M., Weber, V. & Weiss, F., 2010, In: IMA Journal of Applied Mathematics. 8, 4, p. 409-421

    Research output: Contribution to journal › Article › Research › peer review

  12. Published

    The Complexity of Satisfiability for Sub-Boolean Fragments of ALC

    Meier, A. & Schneider, T., 2010, Proceedings of the 23rd International Workshop on Description Logics (DL 2010).

    Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review

  13. 2009
  14. Published

    Model Checking CTL is Almost Always Inherently Sequential

    Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H., Mundhenk, M. & Schneider, T., 2009, TIME 2009, 16th International Symposium on Temporal Representation and Reasoning, Bressanone-Brixen, Italy, 23-25 July 2009, Proceedings. Lutz, C. & Raskin, J.-F. (eds.). IEEE Computer Society, p. 21-28 8 p.

    Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review

  15. Published

    The Complexity of Generalized Satisfiability for Linear Temporal Logic

    Bauland, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 2009, In: Log. Methods Comput. Sci.. 5, 1, 1.

    Research output: Contribution to journal › Article › Research › peer review

  16. Published

    The complexity of propositional implication

    Beyersdorff, O., Meier, A., Thomas, M. & Vollmer, H., 2009, In: Information Processing Letters. 109, 18, p. 1071-1077 7 p.

    Research output: Contribution to journal › Article › Research › peer review

  17. Published

    The Complexity of Satisfiability for Fragments of CTL and CTL*

    Meier, A., Thomas, M., Vollmer, H. & Mundhenk, M., 2009, In: Int. J. Found. Comput. Sci.. 20, 5, p. 901-918

    Research output: Contribution to journal › Article › Research › peer review

  18. Published

    The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I

    Meier, A., Mundhenk, M., Schneider, T., Thomas, M., Weber, V. & Weiss, F., 2009, Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. Královic, R. & Niwinski, D. (eds.). Vol. 5734. p. 587-599 13 p. (Lecture Notes in Computer Science).

    Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review

  19. Published

    The complexity of satisfiability problems: Refining Schaefer's theorem.

    Allender, E., Bauland, M., Immerman, N., Schnoor, H. & Vollmer, H., 2009, In: J. Comput. Syst. Sci.. 75, 4, p. 245-254 10 p., 4.

    Research output: Contribution to journal › Article › Research › peer review

  20. Published

    The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments

    Bauland, M., Mundhenk, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 2009, In: Electronic Notes in Theoretical Computer Science (ENTCS). 231, p. 277-292 16 p.

    Research output: Contribution to journal › Article › Research › peer review

  21. 2008
  22. Published

    The Complexity of Generalized Satisfiability for Linear Temporal Logic

    Bauland, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 28 Dec 2008, In: Logical Methods in Computer Science, Volume.

    Research output: Contribution to journal › Article › Research › peer review

  23. Published

    The Complexity of Reasoning for Fragments of Default Logic

    Beyersdorff, O., Meier, A., Thomas, M. & Vollmer, H., 28 Aug 2008, Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. Kullmann, O. (ed.). Vol. 5584. p. 51-64 14 p. (Lecture Notes in Computer Science).

    Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review

Previous 1...4 5 6 7 8 9 10 11 Next