Elementary Search-based Algorithms for Solving Tilepaint Puzzles
VA Fridolin, M Arzaki… - Indonesia Journal on …, 2023 - socj.telkomuniversity.ac.id
This paper discusses the elementary computational aspects of Tilepaint puzzles, single-
player logic puzzles introduced in 1995 and confirmed NP-complete in 2022. Two …
player logic puzzles introduced in 1995 and confirmed NP-complete in 2022. Two …
[HTML][HTML] Backdoor dnfs
We introduce backdoor DNFs, as a tool to measure the theoretical hardness of CNF
formulas. Like backdoor sets and backdoor trees, backdoor DNFs are defined relative to a …
formulas. Like backdoor sets and backdoor trees, backdoor DNFs are defined relative to a …
[HTML][HTML] SAT backdoors: Depth beats size
For several decades, much effort has been put into identifying classes of CNF formulas
whose satisfiability can be decided in polynomial time. Classic results are the linear-time …
whose satisfiability can be decided in polynomial time. Classic results are the linear-time …
CSP beyond tractable constraint languages
The constraint satisfaction problem (CSP) is among the most studied computational
problems. While NP-hard, many tractable subproblems have been identified (Bulatov, Zhuk) …
problems. While NP-hard, many tractable subproblems have been identified (Bulatov, Zhuk) …
[引用][C] Note on Algorithmic Investigations of Juosan Puzzles
MT Ammar, M Arzaki, GS Wulandari - Jurnal Ilmu Komputer dan Informasi, 2024