## Abstract

This paper considers a number of NP-complete problems, and provides faster algorithms for solving them exactly. The solutions are based on a recursive partitioning of the problem domain, and careful elimination of some of the branches along the search without actually checking them. The time complexity of the proposed algorithms is of the form 0(2^{ϵn}) for constant 0 <ϵ< 1, where n is the output size of the problem. In particular, such algorithms are presented for the Exact SAT and Exact Hitting Set problems (with ϵ = 0.3212), and for the Exact 3SAT problem (with ϵ = 0.2072). Both algorithms improve on previous ones proposed in the literature.

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

Title of host publication | Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings |

Editors | Jaroslav Nešetřil |

Publisher | Springer Verlag |

Pages | 450-461 |

Number of pages | 12 |

ISBN (Print) | 3540662510, 9783540662518 |

DOIs | |

State | Published - 1999 |

Externally published | Yes |

Event | 7th Annual European Symposium on Algorithms, ESA 1999 - Prague, Czech Republic Duration: 16 Jul 1999 → 18 Jul 1999 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1643 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 7th Annual European Symposium on Algorithms, ESA 1999 |
---|---|

Country/Territory | Czech Republic |

City | Prague |

Period | 16/07/99 → 18/07/99 |

### Bibliographical note

Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1999.