Conferències i seminaris | Congressos | Grups de recerca | Publicacions | Persones Persones
Moritz Müller
Publicacions
Consistency and Optimality, 2011
CHEN, Y.; FLUM, J. & MÜLLER, M. `Consistency and Optimality´. In: *Proceedings of the 7th Computability in Europe (CiE)*, Springer LNCS 6735, 61–70 (2011)
Consistency and optimality, 2011
CHEN, Y.; FLUM, J. & MÜLLER, M. *Consistency and optimality*. Publicacions del CRM, núm. 1014 (2011)
Hard instances of algorithms and proof systems, 2010
CHEN, Y.; FLUM, J. & MÜLLER, M. `Hard instances of algorithms and proof systems´. Submitted
Hard instances of algorithms and proof systems, 2011
CHEN, Y.; FLUM, J. & MÜLLER, M. *Hard instances of algorithms and proof systems*. Publicacions del CRM, núm. 1024 (2011)
Lower bounds for kernelizations, 2008
CHEN, Y.; FLUM, J. & MÜLLER, M. *Lower bounds for kernelizations*. Publicacions del CRM, núm. 836 (2008)
Lower bounds for kernelizations and other preprocessing procedures, 2011
CHEN, Y.; FLUM, J. & MÜLLER, M. `Lower bounds for kernelizations and other preprocessing procedures´. *Theory of Computing Systems*; 48 (4), 803–839 (2011)
On optimal algorithms for SAT. Logical Approaches to Barriers in Computing and Complexity, 2010
CHEN Y.; FLUM, J. & MÜLLER, M. *On optimal algorithms for SAT. Logical Approaches to Barriers in Computing and Complexity*. preprint of the Department of Mathematics and Computer Science at the University Greifswald, No. 6 (2010)
On optimal probabilistic algorithms for Sat, 2011
CHEN, Y.; FLUM, J. & MÜLLER, M. *On optimal probabilistic algorithms for Sat*. Publicacions del CRM, núm. 1008 (2011)
Partially definable forcing and bounded arithmetic, 2011
ATSERIAS, A. & MÜLLER, M. *Partially definable forcing and bounded arithmetic*. Publicacions del CRM, núm. 1007 (2011)
Strong isomorphism reductions in complexity theory, 2011
BUSS, S.; CHEN, Y.; FLUM, J.; FRIEDMAN, S.D. & MÜLLER, M. `Strong isomorphism reductions in complexity theory´. *The Journal of Symbolic Logic*; 76, 1381-1402 (2011)
Strong isomorphism reductions in complexity theory, 2011
BUSS, S.; CHEN, Y.; FLUM J.; FRIEDMAN, S.-D. & MÜLLER, M. *Strong isomorphism reductions in complexity theory*. Publicacions del CRM, núm. 1009 (2011)
Participacions a Congressos
Infinity Conference
CRM, Bellaterra (18/7/2011- 22/7/2011)
Organitzat pel programa de recerca Infinity Project (2009-2011)
Altres activitats (conferències, seminaris)
Investigador postdoctoral - Centre de Recerca Matemàtica - PR (2009-2011) Infinity Project [1/9/2009 - 31/8/2011]
On optimal algorithms for SAT (17/2/2010)
Al International Workshop on Logical Approaches to Barriers in Computing and Complexity, Greifswald -Alemanya-, 17 a 20 febrer 2010. No en consta la data exacta
Investigador postdoctoral - Centre de Recerca Matemàtica - PR (2009-2011) Infinity Project [1/9/2009 - 31/8/2011]
Undefinable Forcing (22/10/2010)
Al Prague Logic Seminar, Inst. of Mathematics at the Academy of Sciences -Txèquia-, 22 a 26 novembre 2010. No en consta la data exacta
Investigador postdoctoral - Centre de Recerca Matemàtica - PR (2009-2011) Infinity Project [1/9/2009 - 31/8/2011]
Partially Definable Forcing (1/2/2011)
Al Annual Meeting on Algorithmic Mode Theory (AlMoTh), Univ. Leipzig -Alemanya-, febrer 2011. No en consta la data exacta
Investigador postdoctoral - Centre de Recerca Matemàtica - PR (2009-2011) Infinity Project [1/9/2009 - 31/8/2011]
Consistency and Optimality (1/6/2011)
Al congrés `Computability in Europe´ (CiE), Sofia -Bulgària-, juny 2011. No en consta la data exacta
Investigador postdoctoral - Centre de Recerca Matemàtica - PR (2009-2011) Infinity Project [1/9/2009 - 31/8/2011]
Partially Definable Forcing and Bounded Arithmetic (1/7/2011)
Conferència convidada a la Infinity Conference, CRM, Barcelona, juliol 2011. No en consta la data exacta