Sign In
Sign Up
Proof complexity and feasible arithmetics
Samuel R. Buss
Paul W. Beame
-
/
5
0 votes
Computational Complexity
Proof Theory
Constructive Mathematics
Code
4.3
21 votes
Algorithms to Live By
4.0
37 votes
Clean Code
4.4
35 votes
Hackers
4.1
21 votes
Fermat's Last Theorem
3.9
17 votes
The Soul of a New Machine
4.1
15 votes
Structure and Interpretation of Computer Programs (SICP)
4.4
21 votes
Coders at Work
4.0
18 votes
Calculus
4.1
17 votes
The Black Swan
3.9
27 votes
How to lie with statistics
4.1
21 votes
Masters of Doom
4.1
32 votes
The Cathedral and the Bazaar
4.3
16 votes
In the Beginning...Was the Command Line
3.7
22 votes
The Pragmatic Programmer
4.4
41 votes
Ghost in the wires
4.1
17 votes
Algebra 1
3.8
18 votes
The Mythical Man-Month
4.2
28 votes
Microserfs
4.0
18 votes
Code Complete
4.2
22 votes
JavaScript
4.1
30 votes
How to solve it
4.0
15 votes
Hackers & painters
4.0
16 votes
The Drunkard's Walk
4.0
20 votes
Think Again
3.7
23 votes
The Grand Design
3.7
21 votes
Thinking in systems
4.4
22 votes
The Difference Engine
3.3
22 votes
Daemon
4.1
44 votes
The elegant universe
4.0
22 votes
Gödel, Escher, Bach
4.2
59 votes
Jung's map of the soul
4.7
27 votes
Rogue protocol
4.2
66 votes
The Maddest Obsession
4.1
30 votes
The Wise Man’s Fear
4.3
135 votes
Antifragile
4.1
33 votes
The ones who walk away from Omelas
4.3
34 votes
A darker shade of magic
3.8
44 votes
The Code Book
4.0
35 votes
Artificial condition
4.2
59 votes
Freedom™
4.1
29 votes
The Name of the Wind
4.3
171 votes
The Signal and the Noise
3.9
48 votes
English Grammar in Use
4.1
17 votes
Fooled by randomness
3.9
29 votes
All Systems Red
4.3
29 votes
What If?
4.3
93 votes
The Lathe of Heaven
4.1
42 votes