The following pages link to Jochen Messner (Q690462):
Displaying 16 items.
- A Kolmogorov complexity proof of the Lovász local lemma for satisfiability (Q690463) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- Planarizing Gadgets for Perfect Matching Do Not Exist (Q2912747) (← links)
- A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability (Q3087948) (← links)
- Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games (Q3459906) (← links)
- (Q4251070) (← links)
- (Q4258579) (← links)
- (Q4381398) (← links)
- (Q4472459) (← links)
- (Q4708605) (← links)
- (Q4737159) (← links)
- Planarizing Gadgets for Perfect Matching Do Not Exist (Q4973859) (← links)
- Exact Perfect Matching in Complete Graphs (Q4973885) (← links)
- Pattern matching in trace monoids (Q5048955) (← links)
