Average-case complexity of detecting cliques

Notes on use

Detailed bibliographic record

Summary, etc.：: We investigate the average-case complexity of the k-CLIQUE problem on randomgraphs with an appropriate density of edges. Our results are lower bounds ...

Search by Bookstore

This page shows libraries in Japan other than the National Diet Library that hold the material.

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

Hokkaido University Collection of Scholarly and Academic Papers
Digital
You can check the holdings of institutions and databases with which Institutional Repositories DataBase(IRDB)(Institutional Repository) is linked at the site of Institutional Repositories DataBase(IRDB)(Institutional Repository).
Hokkaido University Collection of Scholarly and Academic Papers

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Material Type: 文書・図像類
Title: Average-case complexity of detecting cliques
Author/Editor: Rossman, Benjamin
Author Heading: Rossman, Benjamin
Publication, Distribution, etc.: ERATO湊離散構造処理系プロジェクト
Publication Date: 2011-06
Publication Date (W3CDTF): 2011-06
ISSN (Periodical Title): PISSN : 2186-1846
Text Language Code: eng
NDC: 007
Target Audience: 一般
Date/Time and Place of an Event: ERATOセミナ ; 2010
Note (General): ERATOセミナ2010 : No.38. 2011年3月7日
Format (IMT): application/pdf
Source: 38_all.pdf （fulltext）
https://eprints.lib.hokudai.ac.jp/dspace/bitstream/2115/48426/1/38_all.pdf
Access Restrictions: インターネット公開
Periodical Title: 2010年度科学技術振興機構ERATO湊離散構造処理系プロジェクト講究録. p.248.
Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）
https://irdb.nii.ac.jp
Original Data Provider (Database): 北海道大学 : 北海道大学学術成果コレクション