Jochen Messner

From MaRDI portal
Person:690462

Available identifiers

zbMath Open messner.jochenMaRDI QIDQ690462

List of research outcomes





PublicationDate of PublicationType
Pattern matching in trace monoids2022-11-09Paper
Exact Perfect Matching in Complete Graphs2019-12-06Paper
Planarizing Gadgets for Perfect Matching Do Not Exist2019-12-06Paper
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games2016-01-11Paper
A Kolmogorov complexity proof of the Lovász local lemma for satisfiability2012-11-27Paper
Planarizing Gadgets for Perfect Matching Do Not Exist2012-09-25Paper
A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability2011-08-17Paper
Nondeterministic functions and the existence of optimal proof systems2009-09-10Paper
On the complexity of resolution with bounded conjunctions2004-11-12Paper
https://portal.mardi4nfdi.de/entity/Q47371592004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44724592004-08-04Paper
Optimal proof systems imply complete sets for promise classes2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q47086052003-06-18Paper
https://portal.mardi4nfdi.de/entity/Q42585792000-05-04Paper
https://portal.mardi4nfdi.de/entity/Q42510701999-11-16Paper
https://portal.mardi4nfdi.de/entity/Q43813981998-07-20Paper

Research outcomes over time

This page was built for person: Jochen Messner

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:690462&oldid=6991989"
Powered by MediaWiki