The books I'm reading on complexity theory primarily are about complexity of decision problems by Turing machines.

I'm interested in computational complexity of circuits, both boolean and continuous circuits (I'm not sure to what extent there is a complexity theory of continuous circuits). Do you know of a good introductory text for this?


closed as primarily opinion-based by xskxzr, David Richerby, Thinh D. Nguyen, Evil, Juho Nov 8 '18 at 8:41

Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise. If this question can be reworded to fit the rules in the help center, please edit the question.

  • $\begingroup$ You can try Jukna's Boolean function complexity. $\endgroup$ – Yuval Filmus Oct 28 '18 at 6:44