Original language | English |
---|---|

Title of host publication | Proceedings of the Annual ACM Symposium on Theory of Computing |

Place of Publication | unknown |

Publisher | Association for Computing Machinery (ACM) |

Pages | - |

Number of pages | 9 |

ISBN (Print) | 0737-8017 |

Publication status | Published - 2006 |

Event | STOC'06. 38th Annual ACM Symposium on Theory of Computing - Seattle, USA Duration: 21 May 2006 → 23 May 2006 |

### Conference

Conference | STOC'06. 38th Annual ACM Symposium on Theory of Computing |
---|---|

Period | 21/05/06 → 23/05/06 |

## Cite this

Fellows, M., Rosamond, F., Rotics, U., & Szeider, S. (2006). Clique-width Minimization is NP-hard. In

*Proceedings of the Annual ACM Symposium on Theory of Computing*(pp. -). Association for Computing Machinery (ACM).