7 citations · 23 across the 12 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism
Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan
The CNF formula satisfiability problem (CNF-SAT) has been reduced to many fundamental problems in P to prove tight lower bounds under the Strong Exponential Time Hypothesis (SETH).…
cs.CC2019
On the Hardness and Inapproximability of Recognizing Wheeler Graphs
Daniel Gibney, Sharma V. Thankachan
In recent years several compressed indexes based on variants of the Burrows-Wheeler transformation have been introduced. Some of these index structures far more complex than a sing…