Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
A Vertex Trigger based on Cylindrical Multiwire Proportional Chambers
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules
The Complexity of Computing Minimal Unidirectional Covering Sets
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
No associations
LandOfFree
Dorothea Baumeister does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Dorothea Baumeister, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dorothea Baumeister will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-115065