The Complexity of Computing Minimal Unidirectional Covering Sets

Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe. The Complexity of Computing Minimal Unidirectional Covering Sets. Theory Comput. Syst., 53(3):467-502, 2013. [doi]

Authors

Dorothea Baumeister

This author has not been identified. Look up 'Dorothea Baumeister' in Google

Felix Brandt

This author has not been identified. Look up 'Felix Brandt' in Google

Felix A. Fischer

This author has not been identified. Look up 'Felix A. Fischer' in Google

Jan Hoffmann 0002

This author has not been identified. Look up 'Jan Hoffmann 0002' in Google

Jörg Rothe

This author has not been identified. Look up 'Jörg Rothe' in Google