Linear Transformations in Boolean Complexity Theory

DOI10.1007/978-3-540-73001-9_32zbMath1151.68023OpenAlexW1487032216MaRDI QIDQ5425332

Joel Friedman

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_32

zbMATH Keywords

cohomologylinear transformationsBoolean circuit complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Betti numbers of polynomial hierarchical models for experimental designs ⋮ Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren Dicks

This page was built for publication: Linear Transformations in Boolean Complexity Theory