Back to Results
First PageMeta Content
Mathematics / Computational complexity theory / Graph theory / Polynomials / Complexity classes / Computational problems / Mathematical optimization / Tutte polynomial / Chromatic polynomial / Optimization problem / NP / Matroid


COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res
Add to Reading List

Document Date: 2014-01-17 04:55:28


Open Document

File Size: 505,33 KB

Share Result on Facebook