"Graphs cannot be indexed in polynomial time for sub-quadratic time string ..."

Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu (2023)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2023.114128

access: open

type: Journal Article

metadata version: 2023-11-01

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/EquiMT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/EquiMT23
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu:
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. Theor. Comput. Sci. 975: 114128 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.