Access count of this item: 106

Files in This Item:
File Description SizeFormat 
1849-02.pdf476.17 kBAdobe PDFView/Open
Title: 森および連結全域部分グラフの乱択近似数え上げ (理論計算機科学の新展開)
Other Titles: Randomized Approximate Counting of Forests and Connected Spanning Subgraphs (New Trends in Theoretical Computer Science)
Authors: 三原, 勇治  KAKEN_name
山内, 由紀子  KAKEN_name
来嶋, 秀治  KAKEN_name
山下, 雅史  KAKEN_name
Author's alias: Mihara, Yuji
Yamauchi, Yukiko
Kijima, Shuji
Yamashita, Masafumi
Issue Date: Aug-2013
Publisher: 京都大学数理解析研究所
Journal title: 数理解析研究所講究録
Volume: 1849
Start page: 8
End page: 11
URI: http://hdl.handle.net/2433/195118
Appears in Collections:New Trends in Theoretical Computer Science

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.