default search action
"Complexity and Stop Conditions for NP as General Assignment Problems, the ..."
Carlos Barrón-Romero (2016)
- Carlos Barrón-Romero:
Complexity and Stop Conditions for NP as General Assignment Problems, the Travel Salesman Problem in R2, Knight Tour Problem and Boolean Satisfiability Problem. CoRR abs/1610.03477 (2016)
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.