Stop the war!
Остановите войну!
for scientists:
default search action
"Why Linear Programming cannot solve large instances of NP-complete ..."
Radoslaw Hofman (2006)
- Radoslaw Hofman:
Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time. CoRR abs/cs/0611008 (2006)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.