Back to Results
First PageMeta Content
NP-complete problems / Analysis of algorithms / Complexity classes / Parameterized complexity / Graph coloring / Dominating set / FO / Time complexity / Tree decomposition / Theoretical computer science / Computational complexity theory / Applied mathematics


Parameterized Complexity for the Database Theorist Martin Grohe Division of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK. Email: 1 . Introduction
Add to Reading List

Document Date: 2006-07-04 06:02:43

Open Document

File Size: 121,06 KB

Share Result on Facebook

City

Edinburgh / WASHINGTON / DC / /

Company

SIAM Journal / /

Country

Canada / United Kingdom / Scotland / /

/

Facility

University of Toronto / University of Edinburgh / /

IndustryTerm

bounded search tree / polynomial time algorithms / reasonable algorithm / evaluation algorithm / straightforward algorithm / query-optimisation algorithm / naive algorithm / fixed-parameter tractable algorithms / optimisation algorithm / output optimisation algorithm / /

Organization

University of Toronto / Toronto / National Science Foundation / Department of Computer Science / Database Theorist Martin Grohe Division of Informatics / University of Edinburgh / /

Person

Leonid Libkin / Emerson / Martin Grohe / Peter Parker / Paul Erd¨os / Thatcher / Lei / /

Position

author / editor / Column editor / model / /

ProgrammingLanguage

SQL / XML / /

ProvinceOrState

Ontario / /

PublishedMedium

SIAM Journal on Computing / Theoretical Computer Science / Theory of Computing / /

Technology

optimisation algorithm / XML / OVER algorithm / ET algorithm / relational database / SET COVER algorithm / evaluation algorithm / straightforward algorithm / reasonable algorithm / naive algorithm / query-optimisation algorithm / polynomial time algorithms / random access / fixed-parameter tractable algorithms / output optimisation algorithm / /

URL

http /

SocialTag