This textbook presents a survey of research on boolean functions circuits parallel computation models function algebras and proof systems its main aim is to elucidate the structure of fast parallel computation the complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics probability theory and finite group theory to finite model theory and proof theory nonuniform computation models are studied in the form of boolean circuits . Boolean functions and computation models texts in theoretical computer science an eatcs series clote peter kranakis evangelos isbn 9783540594369 kostenloser versand fur alle bucher mit versand und verkauf duch amazon. Boolean functions and computation models texts in theoretical computer science an eatcs series clote peter kranakis evangelos isbn 9783642082177 kostenloser versand fur alle bucher mit versand und verkauf duch amazon. This textbook presents a survey of research on boolean functions circuits parallel computation models function algebras and proof systems its main aim is to elucidate the structure of fast para