| Title: |
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Esther Ezra |
-
Georgia Institute of Technology, Atlanta, GA, USA
|
| Micha Sharir |
-
Tel Aviv University, Tel Aviv, Israel, Blavatnik School of Computer Science
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1553354
|
| DBLP Key: |
conf/compgeom/EzraS17
|
| Author Comments: |
|