Back to Results
First PageMeta Content
Complexity classes / Parameterized complexity / Mathematical optimization / Matrix / Kernelization / NP / Rank / 2-satisfiability / Theoretical computer science / Computational complexity theory / Applied mathematics


A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Robert Bredereck∗ , Jiehua Chen† , Sepp Hartung, Rolf Niedermeier and Ondˇrej Such´y‡ Stefan Kratsch
Add to Reading List

Document Date: 2012-05-07 11:13:53


Open Document

File Size: 271,40 KB

Share Result on Facebook

City

Saarbr¨ucken / L. A. / Matching / /

Company

Oxford University Press / Plenum Press / AAAI Press / /

Country

Germany / /

/

IndustryTerm

kernelization algorithm / fixed-parameter algorithms / multi-agent systems / greedy algorithm / feasible algorithm / trivial solution / /

OperatingSystem

XP / /

Organization

Artificial Copyright Intelligence / Association for the Advancement / Oxford University / /

Person

Raman / V / Rolf Niedermeier / Gerhard J. Woeginger / Stefan Kratsch Universiteit Utrecht / /

Position

lobbyist / /

ProgrammingLanguage

L / /

ProvinceOrState

South Carolina / /

PublishedMedium

Theoretical Computer Science / Journal of Artificial Intelligence Research / /

Technology

corresponding algorithm / matching-based algorithm / WAP / fixed-parameter algorithms / artificial intelligence / alternative algorithm / corresponding fixed-parameter algorithms / time algorithm / greedy algorithm / practically feasible algorithm / Cloning / Dom / kernelization algorithm / /

URL

www.aaai.org / /

SocialTag