Gate/transistor number and program length measures of computational complexity?
Two well-known books in this research area are:


  Jeffrey D. Ullman, Computational Aspects of VLSI, Computer Science Press, 1984


and


  F. Tom Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1991.


The connection between space and time complexity is due to the finite speed of communicating across distance.  Thus, a lot of the interesting results are about how various communication networks can (or cannot) be embedded in 3-dimensional space.