|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
科学技術振興機構ERATO湊離散構造処理系プロジェクト講究録 >
2010年度 >
Average-case complexity of detecting cliques
| Title: | Average-case complexity of detecting cliques |
| Authors: | Rossman, Benjamin Browse this author |
| Issue Date: | Jun-2011 |
| Publisher: | ERATO湊離散構造処理系プロジェクト |
| Citation: | 2010年度科学技術振興機構ERATO湊離散構造処理系プロジェクト講究録. p.248. |
| Abstract: | We investigate the average-case complexity of the k-CLIQUE problem on randomgraphs with an appropriate density of edges. Our results are lower bounds of nk=4 fortwo well-studied classes of circuits: bounded-depth circuits and monotone circuits. Besidesbeing the first lower bounds for k-CLIQUE in the average-case (and moreoveressentially tight), these results lead to a new “size hierarchy theorem” for AC0 and settlea longstanding open question in finite model theory. |
| Description: | ERATOセミナ2010 : No.38. 2011年3月7日 |
| Conference Name: | ERATOセミナ |
| Conference Sequence: | 2010 |
| Type: | conference presentation |
| URI: | http://hdl.handle.net/2115/48426 |
| Appears in Collections: | 科学技術振興機構ERATO湊離散構造処理系プロジェクト講究録 > 2010年度
|
|
