On the relationship between energy complexity and other Boolean function measures
From MaRDI portal
Publication:5918744
DOI10.1007/s10878-020-00689-8zbMath1495.90163arXiv1810.03811OpenAlexW3120457329MaRDI QIDQ5918744
Kewen Wu, Yu-An Sun, Xiaoming Sun, Zhiyu Xia
Publication date: 18 July 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.03811
Cites Work
- Unnamed Item
- Energy and fan-in of logic circuits computing symmetric Boolean functions
- Energy and depth of threshold circuits
- An improved lower bound on the sensitivity complexity of graph properties
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
- On the power of small-depth threshold circuits
- The critical complexity of graph properties
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
- A topological approach to evasiveness
- On recognizing graph properties from adjacency matrices
- On the degree of Boolean functions as real polynomials
- Complexity measures and decision tree complexity: a survey.
- On the sensitivity complexity of bipartite graph properties
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
- Threshold circuits of bounded depth
- Almost All Functions Require Exponential Energy
- Energy-efficient circuit design
- On the Computational Power of Threshold Circuits with Sparse Activity
- Monotone Bipartite Graph Properties are Evasive
- Theory of Computational Complexity
- Mathematical Foundations of Computer Science 2005
- New bounds for energy complexity of Boolean functions
- New bounds for energy complexity of Boolean functions
This page was built for publication: On the relationship between energy complexity and other Boolean function measures
