APA (7th ed.) Citation

Hofman, R. (2006). Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time.

Chicago Style (17th ed.) Citation

Hofman, Radoslaw. Why Linear Programming Cannot Solve Large Instances of NP-complete Problems in Polynomial Time. 2006.

MLA (9th ed.) Citation

Hofman, Radoslaw. Why Linear Programming Cannot Solve Large Instances of NP-complete Problems in Polynomial Time. 2006.

Warning: These citations may not always be 100% accurate.