Hot answers tagged

3

Algorithmic Game Theory Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 24 de set. de 2007 History of Computer Science COOPER, S. Barry; VAN LEEUWEN, Jan (Ed.). Alan Turing: His work and impact. Elsevier, 2013. Learning theory Kearns, Michael J., Umesh Virkumar Vazirani, and Umesh Vazirani....


2

Parameterized complexity It might worth adding an answer since no one mentioned this area. A comprehensible, well written quite recent book is Parameterized Algorithms, M. Cygan et al., 2015 Another book is Parameterized complexity, R. Downey and M. Fellows, 1999 Meanwhile the former presents a comprehensible text about most of the used methods and ...


1

Looking at the book, they give a really good example where representational equality doesn't imply equality. You have two unordered collections, which are equal if after sorting and removing duplicates, they are representationally equal. For example Collection A: 5 5 2 3 1 1 1 1 Collection B: 1 5 5 5 3 3 3 2 Are representationally unequal. But if you ...


Only top voted, non community-wiki answers of a minimum length are eligible