Stop the war!
Остановите войну!
for scientists:
default search action
"The Decision Tree Complexity for k-SUM is at most Nearly Quadratic."
Esther Ezra, Micha Sharir (2016)
- Esther Ezra, Micha Sharir:
The Decision Tree Complexity for k-SUM is at most Nearly Quadratic. CoRR abs/1607.04336 (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.