A polynomial-time reduction from the 3SAT problem to the generalized string puzzle problem

From MaRDI portal

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_polynomial-time_reduction_from_the_3SAT_problem_to_the_generalized_string_puzzle_problem&oldid=72377289"