Back to Results
First PageMeta Content
Complexity classes / NP-complete problems / Analysis of algorithms / Parameterized complexity / Mathematical optimization / Vertex cover / Dominating set / Time complexity / FO / Theoretical computer science / Computational complexity theory / Applied mathematics


How to Put Through Your Agenda in Collective Binary Decisions? Noga Alon1 , Robert Bredereck2 , Jiehua Chen2 , Stefan Kratsch2 Rolf Niedermeier2 , and Gerhard J. Woeginger3 2
Add to Reading List

Document Date: 2013-10-23 10:13:29


Open Document

File Size: 353,87 KB

Share Result on Facebook

City

Bruxelles / /

Company

Vertex / Let NV / /

Country

Germany / Belgium / /

Facility

Tel Aviv University / /

IndustryTerm

fixed-parameter algorithms / depth-bounded search tree algorithm / polynomial-time preprocessing algorithms / brute-force search / business to business / /

Organization

Department of Mathematics and Computer Science / Tel Aviv University / Organization for Scientific Research NWO / Israel Institut f¨ / School of Mathematical Sciences / Bonn / /

Person

Ai / Unanimously Accepted / /

Technology

fixed-parameter algorithms / random access / depth-bounded search tree algorithm / polynomial-time preprocessing algorithms / /

SocialTag