### Abstract

The computational complexity of approximating ω(G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME = NEXPTIME and NP= P.

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

Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |

Publisher | Publ by IEEE |

Pages | 2-12 |

Number of pages | 11 |

ISBN (Print) | 0818624450 |

Publication status | Published - Dec 1 1991 |

Event | Proceedings of the 32nd Annual Symposium on Foundations of Computer Science - San Juan, PR, USA Duration: Oct 1 1991 → Oct 4 1991 |

### Publication series

Name | Annual Symposium on Foundations of Computer Science (Proceedings) |
---|---|

ISSN (Print) | 0272-5428 |

### Other

Other | Proceedings of the 32nd Annual Symposium on Foundations of Computer Science |
---|---|

City | San Juan, PR, USA |

Period | 10/1/91 → 10/4/91 |

### ASJC Scopus subject areas

- Hardware and Architecture

## Fingerprint Dive into the research topics of 'Approximating clique is almost NP-complete'. Together they form a unique fingerprint.

## Cite this

Feige, U., Goldwasser, S., Lovasz, L., Safra, S., & Szegedy, M. (1991). Approximating clique is almost NP-complete. In

*Annual Symposium on Foundations of Computer Science (Proceedings)*(pp. 2-12). (Annual Symposium on Foundations of Computer Science (Proceedings)). Publ by IEEE.