Back to Results
First PageMeta Content
NP-complete problems / Tournament / Hamiltonian path / Graph / Graph theory / Theoretical computer science / Mathematics


Smallest Tournaments Not Realizable by 23 -Majority Voting Dylan Shepardson Craig Tovey May[removed]Abstract
Add to Reading List

Document Date: 2011-04-21 15:28:35

Open Document

File Size: 203,14 KB

Share Result on Facebook

City

New Haven / /

Company

Cambridge University Press / Yale University Press / primal LP / /

Country

United Kingdom / United States / /

IndustryTerm

possible binary solutions / feasible solution / Online First / rational optimal solution / /

Organization

Cambridge University / Yale University / /

/

Position

E. Player / representative / row player / player / dual player / Otherwise player / column player / /

Technology

html / /

URL

http /

SocialTag