سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات162
تعداد شماره‌ها6,692
تعداد مقالات72,232
تعداد مشاهده مقاله129,190,247
تعداد دریافت فایل اصل مقاله102,021,356
Heidari, Mahdi, Golshani, Ali, Moazzami, D., Moeini, Ali. (1395). Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model. , 47(1), 79-92. doi: 10.22059/jac.2016.7944
Mahdi Heidari; Ali Golshani; D. Moazzami; Ali Moeini. "Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model". , 47, 1, 1395, 79-92. doi: 10.22059/jac.2016.7944
Heidari, Mahdi, Golshani, Ali, Moazzami, D., Moeini, Ali. (1395). 'Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model', , 47(1), pp. 79-92. doi: 10.22059/jac.2016.7944
Heidari, Mahdi, Golshani, Ali, Moazzami, D., Moeini, Ali. Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model. , 1395; 47(1): 79-92. doi: 10.22059/jac.2016.7944

Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model

Journal of Algorithms and Computation
مقاله 8، دوره 47، شماره 1، شهریور 2016، صفحه 79-92    اصل مقاله (392.76 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2016.7944
نویسندگان
Mahdi Heidari* 1؛ Ali Golshani1؛ D. Moazzami2؛ Ali Moeini2
1Department of Algorithms and Computation, University of Tehran
2University of Tehran, College of Engineering, Faculty of Enginering Science
چکیده
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.
کلیدواژه‌ها
NP-complete problem؛ set splitting problem؛ SAT problem؛ Markov chain
آمار
تعداد مشاهده مقاله: 1,114
تعداد دریافت فایل اصل مقاله: 1,136





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب