Title of article :
Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
Author/Authors :
Heidari, Mahdi Department of Information Technology - Ghent University-imec, Belgium , Golshani, Ali Department of Algorithms and Computation - University of Tehran , Moazzami, D Faculty of Enginering Science - College of Engineering - University of Tehran , Moeini, Ali Faculty of Enginering Science - College of Engineering - University of Tehran
Abstract :
In this paper we restrict every set splitting problem to
the special case in which every set has just three el-
ements. 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
Journal title :
Astroparticle Physics
