Faster exact solutions for some NP-hard problems.
type: Item
instance of: scholarly article
title: Faster exact solutions for some NP-hard problems.
zbMATH Open document ID: 1061.68060
DOI: 10.1016/S0304-3975(01)00257-2
author: Limor Drori
author: David Peleg
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1857033
MaRDI profile type: Publication
cites work: On space-efficient algorithms for certain NP-complete problems
cites work: Q4198056
cites work: Q4250220
cites work: An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
cites work: Solving satisfiability in less than \(2^ n\) steps
cites work: Algorithms for maximum independent sets
cites work: The complexity of satisfiability problems
cites work: A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
cites work: Finding a Maximum Independent Set
description: scientific article; zbMATH DE number 1857033