Нүүр зураг

Some Completeness Results on Decision Trees and Group Testing

-д хадгалсан:
-д хэвлэсэн:SIAM Journal on Matrix Analysis and Applications vol. 8, no. 4 (Oct 1987), p. 762
Үндсэн зохиолч: Du, Ding-Zhu
Бусад зохиолчид: Ko, Ker-I
Хэвлэсэн:
Society for Industrial and Applied Mathematics
Нөхцлүүд:
Algorithms
Decision trees
Queries
Games
Онлайн хандалт:Citation/Abstract
Full Text - PDF
Шошгууд: Шошго нэмэх
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!

MARC

LEADER 00000nab a2200000uu 4500
001 923640047
003 UK-CbPIL
022 |a 0895-4798 
022 |a 1095-7162 
024 7 |a 10.1137/0608062  |2 doi 
035 |a 923640047 
045 2 |b d19871001  |b d19871031 
084 |a 152139  |2 nlm 
100 1 |a Du, Ding-Zhu 
245 1 |a Some Completeness Results on Decision Trees and Group Testing 
260 |b Society for Industrial and Applied Mathematics  |c Oct 1987 
513 |a PERIODICAL 
520 3 |a The computational complexity of the group testing problem is investigated under the minimax measure and the decision tree model. We consider the generalizations of the group testing problem in which partial information about the decision tree of the problem is given. Using this approach, we demonstrate the NP-hardness of several decision problems related to various models of the group testing problem. For example, we show that, for several models of group testing, the problem of recognizing a set of queries that uniquely determines each object is co-NP-complete. 
653 |a Algorithms 
653 |a Decision trees 
653 |a Queries 
653 |a Games 
700 1 |a Ko, Ker-I 
773 0 |t SIAM Journal on Matrix Analysis and Applications  |g vol. 8, no. 4 (Oct 1987), p. 762 
786 0 |d ProQuest  |t ABI/INFORM Global 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/923640047/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/923640047/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch