| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 9 of 9
reviews
|
|
|
 |
|
|
|
|
Limits of computation: an introduction to the undecidable and the intractable
Reiter E., Johnson C., Chapman & Hall/CRC, Boca Raton, FL, 2013. 279 pp. Type: Book (978-1-439882-06-1), Reviews: (1 of 2)
This book is a highly accessible introduction to the theory of computation. It aims to educate the reader on the most fundamental aspects of algorithms and computation. It deals with two big questions: Which problems admit no algorithm...
|
Apr 19 2013 |
|
|
|
|
|
|
Computing optimal outcomes under an expressive representation of settings with externalities
Conitzer V., Sandholm T. Journal of Computer and System Sciences 78(1): 2-14, 2012. Type: Article
Computing optimal allocations is a ubiquitous and notoriously hard computational problem that is significant in settings such as combinatorial auctions. This paper considers an expressive representation of such settings in which agents...
|
Apr 19 2012 |
|
|
|
|
|
|
P, NP, and NP-completeness: the basics of computational complexity
Goldreich O., Cambridge University Press, New York, NY, 2010. 216 pp. Type: Book (978-0-521122-54-2), Reviews: (1 of 2)
Complexity theory--the study of the intrinsic requirement of computational resources to solve algorithmic problems--is a fundamental pillar of theoretical computer science (CS). This book is not only a basic textbook ...
|
Jan 26 2011 |
|
|
|
|
|
|
 Algorithms and theory of computation handbook: 2-volume set
Atallah M., Blanton M., Chapman & Hall/CRC, Boca Raton, FL, 2009. 1938 pp. Type: Book (978-1-584888-18-5), Reviews: (1 of 3)
An up-to-date survey of fundamental computer science topics and techniques is provided in this book. The first edition of the handbook [1] was a useful reference in theoretical computer science. More than a decade has passed since it w...
|
May 6 2010 |
|
|
|
|
|
|
Computing with social trust
Golbeck J. (ed), Springer Publishing Company, Incorporated, 2008. 338 pp. Type: Book (9781848003552)
The growth of distributed networks--the Internet, social networks such as Facebook, economic networks such as eBay, and wireless networks--has brought to the fore the issue of network user trust. Social trust is becom...
|
May 29 2009 |
|
|
|
|
|
|
Game theoretic problems in network economics and mechanism design solutions
Narahari Y., Garg D., Narayanam R., Prakash H., Springer Publishing Company, Incorporated, 2009. 304 pp. Type: Book (9781848009370)
Mechanism design has been called inverse game theory, where mechanisms are designed in such a way that the global aims of the designer are met, based on the selfish strategic behavior of the participants. These global aims may include ...
|
Apr 29 2009 |
|
|
|
|
|
|
Encyclopedia of algorithms
Kao M., Springer-Verlag New York, Inc., Secaucus, NJ, 2008. 1166 pp. Type: Book (9780387307701)
This book was designed to provide a comprehensive overview of developments in solving important algorithmic problems. Kao, the editor, is successful in presenting many of these developments, with contributions from the world’...
|
Apr 8 2009 |
|
|
|
|
|
|
Complex graphs and networks (CBMS Regional Conference Series in Mathematics)
Chung F., Lu L., AMERICAN MATHEMATICAL SOCIETY, Boston, MA, 2006. 264 pp. Type: Book (9780821836576)
Networks are ubiquitous due to the presence of different kinds of social, economic, and information networks around us. The analysis of massive networks such as Internet graphs, social networks, and biological networks requires advance...
|
Mar 27 2009 |
|
|
|
|
|
|
Algorithmic aspects of graph connectivity
Nagamochi H., Ibaraki T., Cambridge University Press, New York, NY, 2008. 392 pp. Type: Book (9780521878647)
Graph connectivity is a central notion within the vast and rich field of graph theory and has long been studied by combinatorialists. It is then natural to examine the algorithmic aspects of graph connectivity and analyze how efficient...
|
Nov 17 2008 |
|
|
|
|
|
| |
|
|
| |
|
|
