| Presentation | 2008-12-03 On the Circuit Complexity of Subgraph Isomorphism Kazuyuki AMANO, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | |
| Paper # | COMP2008-50 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2008/11/26(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | On the Circuit Complexity of Subgraph Isomorphism |
| Sub Title (in English) | |
| Keyword(1) | |
| 1st Author's Name | Kazuyuki AMANO |
| 1st Author's Affiliation | Graduate School of Engineering, Gunma University() |
| Date | 2008-12-03 |
| Paper # | COMP2008-50 |
| Volume (vol) | vol.108 |
| Number (no) | 330 |
| Page | pp.pp.- |
| #Pages | 29 |
| Date of Issue | |