Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM."

Esther Ezra, Micha Sharir (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2017.41

access: open

type: Conference or Workshop Paper

metadata version: 2021-06-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/compgeom/EzraS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/EzraS17
Esther Ezra, Micha Sharir:
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM. SoCG 2017: 41:1-41:15

a service of

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.