Home › Entities › doctoral_thesis › Settling the Complexity of the K-disjointness and the K-hamming Distance Problems

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
Place doctoral_thesis Q113668425
Press Enter · cited answer in seconds

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

Summary

Settling the Complexity of the K-disjointness and the K-hamming Distance Problems is a doctoral thesis[1].

Key Facts

  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems authored Mert Sağlam[2].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's instance of is recorded as doctoral thesis[3].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's OCLC number is recorded as 1120725559[4].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's language of work or name is recorded as English[5].
  • +2019-00-00T00:00:00Z marks the founding of Settling the Complexity of the K-disjointness and the K-hamming Distance Problems[6].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's work available at URL is recorded as http://hdl.handle.net/1773/44144[7].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's number of pages is recorded as {'unit': 'http://www.wikidata.org/entity/Q1069725', 'amount': '+96'}[8].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's number of pages is recorded as {'unit': 'http://www.wikidata.org/entity/Q56761382', 'amount': '+4'}[9].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's Handle ID is recorded as 1773/44144[10].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's title is recorded as Settling the Complexity of the K-disjointness and the K-hamming Distance Problems[11].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's thesis submitted to is recorded as University of Washington[12].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's on focus list of Wikimedia project is recorded as WikiProject PCC Wikidata Pilot/University of Washington[13].
  • Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's thesis committee member is recorded as Shayan Oveis Gharan[14].

Body

Designation and Status

Settling the Complexity of the K-disjointness and the K-hamming Distance Problems's instance of is recorded as doctoral thesis[3].

History and Context

+2019-00-00T00:00:00Z marks the founding of Settling the Complexity of the K-disjointness and the K-hamming Distance Problems[6].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [3] ↑ . WorldCat. Retrieved . wikidata.org.
  2. [2] ↑ . WorldCat. Retrieved . wikidata.org.
  3. [4] ↑ . WorldCat. Retrieved . wikidata.org.
  4. [5] ↑ . WorldCat. Retrieved . wikidata.org.
  5. [6] ↑ . WorldCat. Retrieved . wikidata.org.
  6. [7] ↑ . WorldCat. Retrieved . wikidata.org.
  7. [8] ↑ . WorldCat. Retrieved . wikidata.org.
  8. [9] ↑ . WorldCat. Retrieved . wikidata.org.
  9. [10] ↑ . WorldCat. Retrieved . wikidata.org.
  10. [11] ↑ . WorldCat. Retrieved . wikidata.org.
  11. [12] ↑ . WorldCat. Retrieved . wikidata.org.
  12. [13] ↑ . wikidata.org.
  13. [14] ↑ . WorldCat. Retrieved . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Settling the Complexity of the K-disjointness and the K-hamming Distance Problems. Retrieved May 3, 2026, from https://4ort.xyz/entity/settling-the-complexity-of-the-k-disjointness-and-the-k-hamming-distance-problems
MLA “Settling the Complexity of the K-disjointness and the K-hamming Distance Problems.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/settling-the-complexity-of-the-k-disjointness-and-the-k-hamming-distance-problems.
BibTeX @misc{4ortxyz_settling-the-complexity-of-the-k-disjointness-and-the-k-hamming-distance-problems_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Settling the Complexity of the K-disjointness and the K-hamming Distance Problems}}, year = {2026}, url = {https://4ort.xyz/entity/settling-the-complexity-of-the-k-disjointness-and-the-k-hamming-distance-problems}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Settling the Complexity of the K-disjointness and the K-hamming Distance Problems — https://4ort.xyz/entity/settling-the-complexity-of-the-k-disjointness-and-the-k-hamming-distance-problems (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/settling-the-complexity-of-the-k-disjointness-and-the-k-hamming-distance-problems · Last refreshed: