Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/allerton/TakedaKI15
%A Takeda, Yuki
%A Kaji, Yuichi
%A Ito, Minoru
%B Allerton
%D 2015
%I IEEE
%K dblp
%P 1205-1210
%T On the computational complexity of the solvability of information flow problem with hierarchy constraint.
%U http://dblp.uni-trier.de/db/conf/allerton/allerton2015.html#TakedaKI15
%@ 978-1-5090-1824-6
@inproceedings{conf/allerton/TakedaKI15,
added-at = {2017-05-21T00:00:00.000+0200},
author = {Takeda, Yuki and Kaji, Yuichi and Ito, Minoru},
biburl = {https://www.bibsonomy.org/bibtex/21a302d89b6b9ecbcbe5cc714314db771/dblp},
booktitle = {Allerton},
crossref = {conf/allerton/2015},
ee = {https://doi.org/10.1109/ALLERTON.2015.7447145},
interhash = {8072d0c35899db16a95bacd9203d1545},
intrahash = {1a302d89b6b9ecbcbe5cc714314db771},
isbn = {978-1-5090-1824-6},
keywords = {dblp},
pages = {1205-1210},
publisher = {IEEE},
timestamp = {2019-10-17T23:05:32.000+0200},
title = {On the computational complexity of the solvability of information flow problem with hierarchy constraint.},
url = {http://dblp.uni-trier.de/db/conf/allerton/allerton2015.html#TakedaKI15},
year = 2015
}