Simple reductions from formula-SAT to pattern matching on labeled graphs and subtree isomorphism

DOI10.1137/1.9781611976496.26MaRDI QIDQ6538765

Gary Hoppenworth, Sharma V. Thankachan, Daniel Gibney

Publication date: 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds

This page was built for publication: Simple reductions from formula-SAT to pattern matching on labeled graphs and subtree isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538765)