Back to Results
First PageMeta Content
Complexity classes / Matroid theory / SL / Matroid / Combinatorial optimization / Oracle machine / IP / Cooperative game / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics


COMPLEXITY IN COOPERATIVE GAME THEORY J. M. Bilbao1 , J. R. Fernández2 and J. J. López3 Matemática Aplicada II, Escuela Superior de Ingenieros Camino de los Descubrimientos s/n, 41092 Sevilla, Spain http://www.esi.us
Add to Reading List

Document Date: 2004-03-02 07:07:34


Open Document

File Size: 139,97 KB

Share Result on Facebook

City

Berlin / Amsterdam / Reading / Sevilla / /

Company

Elsevier Science B.V. / W. Kern S. P. / MFG / /

Country

Netherlands / Spain / /

Currency

cent / /

/

Facility

University of Twente / University of Maastricht / /

IndustryTerm

improved network optimization algorithms / n4 algorithm / efficient algorithm / polynomial time algorithm / greedy algorithm / polynomial-time algorithm / communication network / oracle-polynomial time algorithm / /

Organization

University of Twente / University of Maastricht / J. Assoc. / /

Person

Owen / Zhu / /

Position

player / /

ProvinceOrState

Massachusetts / /

Technology

oracle-polynomial time algorithm / efficient algorithm / s/n / polynomial time algorithm / n4 algorithm / improved network optimization algorithms / time algorithm / polynomial-time algorithm / greedy algorithm / /

URL

http /

SocialTag