 | 2009 |
|---|
| 7 |       | Dorothea Baumeister,
Felix Brandt,
Felix A. Fischer,
Jörg Rothe:
Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP
CoRR abs/0901.3692: (2009) |
| 6 | | Dorothea Baumeister,
Jörg Rothe:
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem.
Fundam. Inform. 91(1): 35-51 (2009) |
| 5 | | Dorothea Baumeister,
Jörg Rothe:
The three-color and two-color TantrixTM rotation puzzle problems are NP-complete via parsimonious reductions.
Inf. Comput. 207(11): 1119-1139 (2009) |
| 2008 |
|---|
| 4 | | Dorothea Baumeister,
Jörg Rothe:
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions.
LATA 2008: 76-87 |
| 2007 |
|---|
| 3 | | Dorothea Baumeister,
Jörg Rothe:
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem.
MCU 2007: 134-145 |
| 2 | | Dorothea Baumeister,
Jörg Rothe:
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem
CoRR abs/0705.0915: (2007) |
| 1 | | Dorothea Baumeister,
Jörg Rothe:
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
CoRR abs/0711.1827: (2007) |
