Reconstructing set partitions

Vladimir Grebinski, Gregory Kucherov

Результат исследований: Вклад в конференциюДокументрецензирование

2 Цитирования (Scopus)

Аннотация

A study was conducted to solve the given combinatorial search problem of reconstructing an unknown partition of the set [n] = {1, ..., n} into at most K disjoint non-empty subsets by making queries about subsets Qi ⊂ or = [n] such that the query returns the number of classes represented in Qi. The goal is to reconstruct the whole partition with as few queries as possible. A variant of the problem where a representative of each class should be found without necessarily reconstructing the whole partition was also considered.

Язык оригиналаАнглийский
СтраницыS915-S916
СостояниеОпубликовано - 1999
Опубликовано для внешнего пользованияДа
СобытиеProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Продолжительность: 17 янв. 199919 янв. 1999

Конференция

КонференцияProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
ГородBaltimore, MD, USA
Период17/01/9919/01/99

Fingerprint

Подробные сведения о темах исследования «Reconstructing set partitions». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать