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 - Client-to-client protocol - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2004-03-02 07:07:34 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 Source URL: www.esi2.us.es Download Document from Source Website File Size: 139,97 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document