![Mathematics / Computational complexity theory / Graph theory / Polynomials / Complexity classes / Computational problems / Mathematical optimization / Tutte polynomial / Chromatic polynomial / Optimization problem / NP / Matroid Mathematics / Computational complexity theory / Graph theory / Polynomials / Complexity classes / Computational problems / Mathematical optimization / Tutte polynomial / Chromatic polynomial / Optimization problem / NP / Matroid](https://www.pdfsearch.io/img/96fcaa573f3ee191facb957affc0b517.jpg) Date: 2014-01-17 04:55:28Mathematics 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, resAdd to Reading ListSource URL: www-cc.cs.uni-saarland.deDownload Document from Source Website File Size: 505,33 KBShare Document on Facebook
|