Complexity of Linear Boolean Operators
From MaRDI portal
Publication:5396765
DOI10.1561/0400000063zbMath1280.68004OpenAlexW4205717186MaRDI QIDQ5396765
No author found.
Publication date: 3 February 2014
Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/0400000063
computational complexitycomputational models and complexitycomputational aspects of combinatorics and graph theory
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Separating OR, SUM, and XOR circuits, Rectifier Circuits of Bounded Depth, On the computation complexity of the systems of finite abelian group elements, On the additive complexity of GCD and LCM matrices, Lower bounds for matrix factorization, Lower bounds for matrix factorization, Comparing the computational complexity of monomials and elements of finite abelian groups, Cancellation-free circuits in unbounded and bounded depth
