Intl. Colloquium on Automata, Languages, and Programming, ICALP 2018


Article Details
Title: Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication
Article URLs:
Alternative Article URLs:
Authors: Daniel Graf
  • ETH Zurich, Department of Computer Science
Karim Labib
  • ETH Zurich, Department of Computer Science
Przemyslaw Uznanski
  • ETH Zurich, Department of Computer Science
Sharing: Research produced no artifacts
Verification: Authors have verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/icalp/0001LU18
Author Comments:

Discuss this paper and its artifacts below