Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

ALGORITHMICA
2008

favoriteEmaildiscussreport

88views more ALGORITHMICA 2008»

Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings

13 years 10 months ago

Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings

Download www.cs.lu.se

We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion

Andreas Björklund, Thore Husfeldt

Real-time Traffic

ALGORITHMICA 2008 | Exact Algorithms | Exact Satisfiability Problem | Polynomial Space |

claim paper

Related Content

» Exact Local Reconstruction Algorithms for Signals with Finite Rate of Innovation

» Fractional Matching Via BallsandBins

» MaxSolver An efficient exact algorithm for weighted maximum satisfiability

» Asymptotic behaviour and optimal word size for exact and approximate word matches between ...

» Maximum Bipartite Matching Size And Application to Cuckoo Hashing

» Exact match search in sequence data using suffix trees

» Clustering exact matches of pairwise sequence alignments by weighted linear regression

» Random Bichromatic Matchings

» Sharp Separation and Applications to Exact and Parameterized Algorithms

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2008
Where	ALGORITHMICA
Authors	Andreas Björklund, Thore Husfeldt

Comments (0)