Complexity of Linear Boolean Operators

Foundations and Trends in Theoretical Computer Science Vol. 9, No. 1 (2013) 1-123 NOW publishers Inc doi: 10.1561/0400000063 ISBN 978-1-60198-726-6-24507-7 Book  pdf List of Errata

1. Problem 7.7 solved (by Igor, 04.06.2017)
2. Problem 7.4 solved (by Igor, 15.04.2017)
3. Some progress on open problems (6.03.2016)
4. On XOR complexity of circulant matrices (18.08.2014)
5. On OR complexities of matrices and their complements: almost maximal gaps for explicit matrices $A$ (3.03.2014)
6. T.G Tarjan's paper [103] of 1975
7. SUM complexity of dense matrices (21.02.2019)
8. SUM-complexity gaps for matrices and their complements (6.02.2021)
9. Bounds on the OR-rank of Kronecker products (20.03.2022)
10. Efficient SUM-coverings for Kronecker powers of matrices (21.12.2022)