Karteek Sreenivasaiah
(The Institute of Mathematical Sciences, 2015)
This thesis is divided into two main parts. The first part deals with proof systems computable by Boolean circuit families that characterize the complexity class NC0 (bounded fanin, constant depth), which is one of the ...