Document Type : Research Paper

Authors

• Mahdi Heidari ¹
• Ali Golshani ¹
• D. Moazzami ²
• Ali Moeini ²

¹ Department of Algorithms and Computation, University of Tehran

² University of Tehran, College of Engineering, Faculty of Enginering Science

Abstract

In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section of this paper we introduce "Fast Split" algorithm.

Keywords

• NP-complete problem
• set splitting problem
• SAT problem
• Markov chain