The Closest Pair Problem under the Hamming Metric

DOI10.1007/978-3-642-02882-3_21zbMath1248.68256OpenAlexW1481666872MaRDI QIDQ5323065

Kerui Min, Hong Zhu, Ming-Yang Kao

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ⋮ Hamming Distance Completeness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• A practical algorithm for Boolean matrix multiplication
• Fast rectangular matrix multiplication and applications
• Rectangular matrix multiplication revisited
• \(L_{1}\) pattern matching lower bound
• Bounds for Binary Codes With Narrow Distance Distributions
• Fast recognition of pushdown automaton and context-free languages
• Automata, Languages and Programming
• Automata, Languages and Programming