SIGN IN
SIGN UP
Leontief economies encode nonzero sum two-player games
Full Text:
Pdf
Buy this Article
Authors:
Bruno Codenotti
IIT-CNR, Pisa, Italy
Amin Saberi
Stanford University, Stanford CA
Kasturi Varadarajan
The University of Iowa, Iowa City IA
Yinyu Ye
Stanford University, Stanford CA
2006 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 17
· Downloads (cumulative): 267
· Citation Count: 24
Published in:
· Proceeding
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Pages 659 - 667
ACM
New York, NY
, USA
©2006
table of contents
ISBN:0-89871-605-5
doi>
10.1145/1109557.1109629
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
combinatorial algorithms
reducibility and completeness
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder