On complexity as bounded rationality (extended abstract)

Christos H. Papadimitriou, Mihalis Yannakakis · 1994

Article Free Access Share on On complexity as bounded rationality (extended abstract) Authors: Christos H. Papadimitriou Department of Computer Science and Engineering, University of California at San Diego Department of Computer Science and Engineering, University of California at San DiegoView Profile , Mihalis Yannakakis AT&T Bell Laboratories, Murray Hill, NJ AT&T Bell Laboratories, Murray Hill, NJView Profile Authors Info & Claims STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of ComputingMay 1994 Pages 726–733https://doi.org/10.1145/195058.195445Online:23 May 1994Publication History 60citation1,269DownloadsMetricsTotal Citations60Total Downloads1,269Last 12 Months76Last 6 weeks9 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Read the paper · More papers on PaperTik