Artykuł w czasopiśmie
Brak miniatury
Licencja
CC-BYCC-BY - Uznanie autorstwa
 

Hardness of Detecting Abelian and Additive Square Factors in Strings

Uproszczony widok
cris.lastimport.scopus2024-02-12T20:04:12Z
dc.affiliationUniwersytet Warszawski
dc.conference.countryPortugalia
dc.conference.datefinish2021-09-08
dc.conference.datestart2021-09-06
dc.conference.placeLizbona
dc.conference.seriesEuropean Symposium on Algorithms
dc.conference.seriesEuropean Symposium on Algorithms
dc.conference.seriesshortcutESA
dc.conference.weblinkhttp://algo2021.tecnico.ulisboa.pt/ESA2021/
dc.contributor.authorRadoszewski, Jakub
dc.contributor.authorRytter, Wojciech
dc.contributor.authorWaleń, Tomasz
dc.contributor.authorZuba, Wiktor
dc.contributor.authorStraszyński, Juliusz
dc.date.accessioned2024-01-25T02:55:06Z
dc.date.available2024-01-25T02:55:06Z
dc.date.copyright2021-08-31
dc.date.issued2021
dc.description.accesstimeAT_PUBLICATION
dc.description.financePublikacja bezkosztowa
dc.description.versionFINAL_PUBLISHED
dc.description.volume204
dc.identifier.doi10.4230/LIPICS.ESA.2021.77
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/108288
dc.identifier.weblinkhttps://doi.org/10.4230/LIPIcs.ESA.2021.77
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.pages77:1-77:19
dc.rightsCC-BY
dc.sciencecloudnosend
dc.subject.enAbelian square
dc.subject.enadditive square
dc.subject.en3SUM problem
dc.titleHardness of Detecting Abelian and Additive Square Factors in Strings
dc.typeJournalArticle
dspace.entity.typePublication