Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case
From MaRDI portal
Publication:2151382
DOI10.1007/978-3-030-93176-6_32zbMath1498.68107OpenAlexW4206059091MaRDI QIDQ2151382
Luiz Satoru Ochi, Uéverton S. Souza, Janio Carlos Nascimento Silva
Publication date: 1 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_32
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Networks and circuits as models of computation; circuit complexity (68Q06) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Revisiting the complexity of and/or graph solution
- Graph minors. III. Planar tree-width
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Quickly excluding a planar graph
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
- Succinct certification of monotone circuits
- Contraction obstructions for treewidth
- Tractability, hardness, and kernelization lower bound for and/or graph solution
- On the Complexity of Speed Scaling
- Energy-efficient circuit design
- Nonuniform ACC Circuit Lower Bounds
- On the Computational Power of Threshold Circuits with Sparse Activity
- Amplifying lower bounds by means of self-reducibility
- Energy Complexity of Recurrent Neural Networks
- Parameterized Algorithms
- New bounds for energy complexity of Boolean functions
This page was built for publication: Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case
