Articles with public access mandates - Moritz MüllerLearn more
Not available anywhere: 1
Revisiting Space in Proof Complexity: Treewidth and Pathwidth
M Müller, S Szeider
International Symposium on Mathematical Foundations of Computer Science, 704-716, 2013
Mandates: Austrian Science Fund
Available somewhere: 24
Automating Resolution is NP-hard.
A Atserias, M Müller
Journal of the ACM 67 (5), Article No.: 31, 2020
Mandates: European Commission
Feasibly constructive proofs of succinct weak circuit lower bounds
M Müller, J Pich
Annals of Pure and Applied Logic 171 (2), 102735, 2020
Mandates: Austrian Science Fund, Natural Sciences and Engineering Research Council of …
The fine classification of conjunctive queries and parameterized logarithmic space
H Chen, M Müller
ACM Transactions on Computation Theory (TOCT) 7 (2), 1-27, 2015
Mandates: Austrian Science Fund, Government of Spain
Parameterized random complexity
JA Montoya, M Müller
Theory of Computing Systems 52, 221-270, 2013
Mandates: Austrian Science Fund
Lower bounds for DNF-refutations of a relativized weak pigeonhole principle
A Atserias, M Müller, S Oliva
The Journal of Symbolic Logic 80 (2), 450-476, 2015
Mandates: Austrian Science Fund, Government of Spain
Partially definable forcing and bounded arithmetic
A Atserias, M Müller
Archive for Mathematical Logic 54 (1-2), 1-33, 2015
Mandates: Austrian Science Fund
Polynomial time ultrapowers and the consistency of circuit lower bounds
J Bydžovský, M Müller
Archive for Mathematical Logic 59 (1), 127-147, 2020
Mandates: Austrian Science Fund, European Commission
The fine classification of conjunctive queries and parameterized logarithmic space complexity
H Chen, M Müller
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2013
Mandates: Austrian Science Fund, Government of Spain
Typical forcings, NP search problems and an extension of a theorem of Riis
M Müller
Annals of Pure and Applied Logic 172 (4), Article 102930, 2021
Mandates: European Commission
Cobham recursive set functions
A Beckmann, S Buss, SD Friedman, M Müller, N Thapen
Annals of Pure and Applied Logic 167 (3), 335-369, 2016
Mandates: US National Science Foundation, Austrian Science Fund
A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
Y Chen, M Müller, K Yokoyama
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
Mandates: Austrian Science Fund, National Natural Science Foundation of China …
A remark on pseudo proof systems and hard instances of the satisfiability problem
J Maly, M Müller
Mathematical Logic Quarterly 64 (6), 418-428, 2018
Mandates: Austrian Science Fund, European Commission
Bounded variable logic, parameterized logarithmic space, and Savitch’s theorem
Y Chen, M Müller
International Symposium on Mathematical Foundations of Computer Science, 183-195, 2014
Mandates: Austrian Science Fund, National Natural Science Foundation of China
An algebraic preservation theorem for aleph-zero categorical quantified constraint satisfaction
H Chen, M Müller
Logical Methods in Computer Science 9, 2013
Mandates: Austrian Science Fund, Government of Spain
On the consistency of circuit lower bounds for non-deterministic time
A Atserias, S Buss, M Müller
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1257-1270, 2023
Mandates: Government of Spain
The parameterized space complexity of model-checking bounded variable first-order logic
Y Chen, M Elberfeld, M Müller
Logical Methods in Computer Science 15, 2019
Mandates: Austrian Science Fund, National Natural Science Foundation of China …
Cobham recursive set functions and weak set theories
A Beckmann, S Buss, SD Friedman, M Müller, N Thapen
Sets And Computations, 55-116, 2018
Mandates: US National Science Foundation, Austrian Science Fund, European Commission
The parameterized space complexity of embedding along a path
H Chen, M Müller
Theory of Computing Systems 61 (3), 851-870, 2017
Mandates: Government of Spain
On representations of intended structures in foundational theories
N Barton, M Müller, M Prunescu
Journal of Philosophical Logic 51 (2), 283-296, 2022
Mandates: Volkswagen Foundation, European Commission
Publication and funding information is determined automatically by a computer program