Back to Results
First PageMeta Content
NP-complete problems / Analysis of algorithms / Matroid theory / Parameterized complexity / Complexity classes / Clique problem / Vertex cover / Time complexity / Matroid / Theoretical computer science / Computational complexity theory / Mathematics


Exact Algorithms and Fixed-Parameter Tractability Summary of Dagstuhl Seminar[removed]July–29. July 2005 Rod Downey 1
Add to Reading List

Document Date: 2006-01-19 05:18:59


Open Document

File Size: 75,20 KB

Share Result on Facebook

Company

Vertex / /

IndustryTerm

polynomial time algorithms / fixed-parameter algorithms / fpt-algorithms / dynamic programming algorithm / database systems / improved exact algorithms / /

Person

I. van Rooij / Rod Downey / /

Position

Psychologist / salesman / /

Technology

1.732n algorithm / 2m/4 algorithm / dynamic programming algorithm / fixed-parameter algorithms / polynomial time algorithms / genotype / super-polynomial time algorithms / ever improving algorithms / /

URL

http /

SocialTag