Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The complexity of the Approximate Multiple Pattern Matching Problem for random strings - MaRDI portal

The complexity of the Approximate Multiple Pattern Matching Problem for random strings

From MaRDI portal

Publication:5874424

Jump to:navigation, search

DOI10.4230/LIPIcs.AofA.2020.24OpenAlexW3038001709MaRDI QIDQ5874424

Clément Requilé, Stephan G. Wagner, Dimbinaina Ralaivaosaona

Publication date: 7 February 2023

Full work available at URL: https://hal.science/hal-03214615

zbMATH Keywords

number of spanning trees number of edges number of blocks subcritical graph class block statistic

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

This page was built for publication: The complexity of the Approximate Multiple Pattern Matching Problem for random strings

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5874424&oldid=30738860"