Approximate All-Pairs Hamming Distances and 0–1 Matrix Multiplication

Lecture notes in computer science 2026

View at publisher
Authors: Mirosław Kowaluk, Andrzej Lingas, Mia Persson
DOI: 10.1007/978-3-032-15621-1_4
Cited by: 0
References: 19

Fields of Study & Subjects

Stochastic Gradient Optimization Techniques Complexity and Algorithms in Graphs Polynomial and algebraic computation

Publication details

Journal / source
Lecture notes in computer science
Pages
38–49
Publication date
1 January 2026
Language
EN