10 citations · 16 across the 3 of their papers we have counts for
3 papers
cs.AI2011★ 3 cited
Solving Rubik's Cube Using SAT Solvers
Jingchao Chen
Rubik's Cube is an easily-understood puzzle, which is originally called the "magic cube". It is a well-known planning problem, which has been studied for a long time. Yet many simp…
cs.DS2007★ 10 cited
Iterative Rounding for the Closest String Problem
Jing-Chao Chen
The closest string problem is an NP-hard problem, whose task is to find a string that minimizes maximum Hamming distance to a given set of strings. This can be reduced to an intege…
cs.DS2007★ 3 cited
XORSAT: An Efficient Algorithm for the DIMACS 32-bit Parity Problem
Jing-Chao Chen
The DIMACS 32-bit parity problem is a satisfiability (SAT) problem hard to solve. So far, EqSatz by Li is the only solver which can solve this problem. However, This solver is very…