Home › Entities › academia › Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails

Research article (Theoretical Computer Science, 2023) · cited 13× · AI/ML
academia openalex:W3010580865
Press Enter · cited answer in seconds

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails

Summary

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails is a scholarly article[1].

Key Facts

  • Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails's instance of is recorded as scholarly article[2].

Related Entities

Alexandru I. Tomescu Veli Mäkinen

References

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

Direct Wikidata claims

  1. [2] ↑ . 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). Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. Retrieved May 24, 2026, from https://4ort.xyz/entity/graphs-cannot-be-indexed-in-polynomial-time-for-sub-quadratic-time-string-matching-unless-seth-fails
MLA “Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/graphs-cannot-be-indexed-in-polynomial-time-for-sub-quadratic-time-string-matching-unless-seth-fails.
BibTeX @misc{4ortxyz_graphs-cannot-be-indexed-in-polynomial-time-for-sub-quadratic-time-string-matching-unless-seth-fails_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails}}, year = {2026}, url = {https://4ort.xyz/entity/graphs-cannot-be-indexed-in-polynomial-time-for-sub-quadratic-time-string-matching-unless-seth-fails}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails — https://4ort.xyz/entity/graphs-cannot-be-indexed-in-polynomial-time-for-sub-quadratic-time-string-matching-unless-seth-fails (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/graphs-cannot-be-indexed-in-polynomial-time-for-sub-quadratic-time-string-matching-unless-seth-fails · Last refreshed: