Spremljaj
Moritz Müller
Moritz Müller
Neznano partnerstvo
Preverjeni e-poštni naslov na uni-passau.de
Naslov
Navedeno
Navedeno
Leto
Automating Resolution is NP-hard.
A Atserias, M Müller
Journal of the ACM 67 (5), Article No.: 31, 2020
472020
Lower Bounds for Kernelizations and Other Preprocessing Procedures
Y Chen, J Flum, M Müller
CiE’09: Proceedings of the 5th Conference, 118-128, 2009
472009
Feasibly constructive proofs of succinct weak circuit lower bounds
M Müller, J Pich
Annals of Pure and Applied Logic 171 (2), 102735, 2020
322020
Parameterized random complexity
JA Montoya, M Müller
Theory of Computing Systems 52, 221-270, 2013
222013
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
212015
Approximating solution structure
M Hamilton, M Müller, I van Rooij, T Wareham
Internat. Begegnungs-und Forschungszentrum für Informatik, 2007
182007
Randomized approximations of parameterized counting problems
M Müller
Parameterized and Exact Computation: Second International Workshop, IWPEC …, 2006
182006
Topological dynamics of unordered Ramsey structures
M Müller, A Pongrácz
Fundamenta Mathematicae 230 (1), 77-98, 2015
172015
Parameterized derandomization
M Müller
Parameterized and Exact Computation: Third International Workshop, IWPEC …, 2008
172008
One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries
H Chen, M Müller
ACM Transactions on Computational Logic (TOCL) 18 (4), 1-37, 2017
162017
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
152015
Strong isomorphism reductions in complexity theory
S Buss, Y Chen, J Flum, SD Friedman, M Müller
The Journal of Symbolic Logic 76 (4), 1381-1402, 2011
142011
Partially definable forcing and bounded arithmetic
A Atserias, M Müller
Archive for mathematical logic 54 (1-2), 1-33, 2015
122015
Hard instances of algorithms and proof systems
Y Chen, J Flum, M Müller
ACM Transactions on Computation Theory (TOCT) 6 (2), 1-25, 2014
122014
W-hierarchies defined by symmetric gates
M Fellows, J Flum, D Hermelin, M Müller, F Rosamond
Theory of Computing Systems 46 (2), 311-339, 2010
112010
Valiant-Vazirani lemmata for various logics
M Müller
Electronic Colloquium on Computational Complexity (ECCC) 15 (063), 2008
112008
Lower bounds for kernelizations
Y Chen, J Flum, M Müller
Centre de Recerca Matemàtica, 2008
92008
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
82013
Polynomial time ultrapowers and the consistency of circuit lower bounds
J Bydžovský, M Müller
Archive for Mathematical Logic 59 (1-2), 127-147, 2020
72020
A purely democratic characterization of W [1]
M Fellows, D Hermelin, M Müller, F Rosamond
International Workshop on Parameterized and Exact Computation, 103-114, 2008
72008
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20