Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings 328-337 2009年 [査読有り]
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2007, PROCEEDINGS 4501 187-+ 2007年 [査読有り]
Gopalan et al. studied in ICALP06 [17] connectivity properties of the solution-space of Boolean formulas, and investigated complexity issues on the connectivity problems in Schaefer's framework. A set S of logical relations is SCHAEFER if all rela...