Now showing items 1-2 of 2

    • A parameterized halting problem, the linear time hierarchy, and the MRDP theorem 

      Chen, Yijia; Muller, Moritz Martin; Yokoyama, Keita (Association for Computing Machinery (ACM), 2018)
      Conference report
      Open Access
      The complexity of the parameterized halting problem for nondeterministic Turing machines p-Halt is known to be related to the question of whether there are logics capturing various complexity classes [10]. Among others, ...
    • The parameterized space complexity of model-checking bounded variable first-order logic 

      Chen, Yijia; Elberfeld, Michael; Muller, Moritz Martin (2019)
      Open Access
      The parameterized model-checking problem for a class of first-order sentences (queries) asks to decide whether a given sentence from the class holds true in a given relational structure (database); the parameter is the ...