# Settling the Complexity of the K-disjointness and the K-hamming Distance Problems

> doctoral thesis by Mert Sağlam, Computer Science & Engineering, University of Washington, 2019

**Wikidata**: [Q113668425](https://www.wikidata.org/wiki/Q113668425)  
**Source**: https://4ort.xyz/entity/settling-the-complexity-of-the-k-disjointness-and-the-k-hamming-distance-problems


## References

1. WorldCat