| Article Details | ||
|---|---|---|
| Title: | Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Piotr Indyk |
|
| Sharing: | Unknown | |
| Verification: | Author has not verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: |
|
|
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | ||
| DBLP Key: | conf/spaa/Indyk17 | |
| Author Comments: | ||