Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
The Complexity of Computing Minimal Unidirectional Covering Sets
No associations
LandOfFree
Jan Hoffmann does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Jan Hoffmann, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Jan Hoffmann will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-115067