Stop the war!
Остановите войну!
for scientists:
default search action
"Lower bound for the Complexity of the Boolean Satisfiability Problem."
Carlos Barron-Romero (2016)
- Carlos Barron-Romero:
Lower bound for the Complexity of the Boolean Satisfiability Problem. CoRR abs/1602.06867 (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.