Computational Complexity: A Conceptual Perspective by Oded Goldreich (2008)

This book provides an extensive outlook on contemporary subjects in complexity theory, a pivotal domain within the theoretical underpinnings of computer science. It explores the fundamental question of what can be accomplished within specific time constraints and with other restricted natural computational resources. [Read More]

A primer on pseudorandom generators by Oded Goldreich (2010)

This introduction to the theory of pseudorandomness offers a fresh perspective on the concept of randomness, rooted in a complexity-theoretic approach. At its core, this approach posits that a distribution is considered random (or pseudorandom) if no efficient procedure can distinguish it from the uniform distribution. [Read More]

Computability and complexity from a programming perspective by Neil Jones (2022)

Computability and complexity theory should be focal points for both practitioners and theorists. Regrettably, the field is often considered challenging to navigate. Neil Jones seeks to bridge the gap between computability and complexity theory and other realms of computer science, particularly programming. [Read More]

The complexity of boolean functions by Ingo Wegner (2006)

When Goethe revisited his work “IPHIGENIE AUF TAURIS” eight years after its initial publication, he expressed a sentiment (perhaps with a touch of resignation, excuse, or explanation) that a work is never truly finished; one must declare it complete when constraints of time and circumstances allow. [Read More]

Automata And Computability by Dexter Kozen (1997)

This textbook aims to offer undergraduate students an introduction to the fundamental theoretical models of computability, delving into the diverse and intricate structure of these models. It caters to students with some background in elementary discrete mathematics, presenting a well-paced initial course with additional chapters introducing more advanced concepts. [Read More]

Introduction to the theory of computation. Solution manual by Michael Sipser (2012)

Solutions manual to a highly anticipated revision builds upon the strengths of the previous edition. Sipser’s candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative “proof idea” sections explain profound concepts in plain English. [Read More]

Introduction To The Theory Of Computation (2nd ed) by Michael Sipser (2006)

This highly anticipated revision builds upon the strengths of the previous edition. Sipser’s candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative “proof idea” sections explain profound concepts in plain English. [Read More]

An introduction to the mathematics of money by David Lovelock (2007)

This undergraduate textbook explores fundamental aspects of personal savings and investing, offering a well-balanced blend of mathematical rigor and economic intuition. Rather than assuming elementary real analysis, the book employs routine financial calculations as both motivation and the foundation for elementary real analysis tools. [Read More]

Introduction to The design and Analysis of Algorithms (3rd ed.). Solutions manual by Anany Levitin (2011)

Solutons manual to “Introduction to the design and analysis of algorithms (3rd ed.)” by Anany Levitin (2011). A-must-have book to aquire a solid knowledge in theory of computation. Solve as much as possible and check your solution. [Read More]