P-matrix recognition is co-NP-complete

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This is a summary of the proof by G.E. Coxson that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn.
9 pages

Keywords

Computational Complexity

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/140282

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0710.3519
 http://arxiv.org/abs/0710.3519

Collections

arXiv