Müller, Moritz

1. Typical forcings, NP search problems and an extension of a theorem of\n Riis
   2020/12/16 by Moritz Müller, Müller, Moritz · 1 citation
   Computer Science · Mathematics · #Computability, Logic, AI Algorithms #Advanced Topology and Set Theory #Complexity and Algorithms in Graphs
2. A parameterized halting problem, Δ₀ truth and the MRDP theorem
   2022/11/11 by Yijia Chen, Moritz Müller, Chen, Yijia +3 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #semigroups and automata theory
3. On the Consistency of Circuit Lower Bounds for Non-Deterministic Time
   2023/03/02 by Albert Atserias, Sam Buss, Atserias, Albert +3 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Machine Learning and Algorithms #Numerical Methods and Algorithms
4. Automating Resolution is NP-Hard
   2019/04/05 by Atserias, Albert, Müller, Moritz · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)