Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Hofman, Radoslaw
Format:	Preprint
Published:	2006
Subjects:	Computational Complexity Discrete Mathematics Data Structures and Algorithms Numerical Analysis F.1; F.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/cs/0611008