@techreport{oai:ipsj.ixsq.nii.ac.jp:00234045,
 author = {Jayalal, Sarma and 内澤, 啓},
 issue = {6},
 month = {May},
 note = {入力数に制限のない論理積素子および論理和素子，さらに否定素子からなる論理回路を考える．本報告では，エネルギーが e に制限された論理回路に現れる出力パターンの個数が，2O(e log e) となることを述べる．ここで論理回路のエネルギーとは，入力に対して回路内で出力が 1 となる論理素子の個数の最大値として定義される．, For a Boolean circuit consisting of AND-gates and OR-gates of unbounded fan-in, and the negation gate, we prove that the number of output patterns that arise in a circuit of energy e is bounded by 2O(e log e), where the energy of a circuit is defined as the number of gates outputting ones in the circuit taken over all the input assignments.},
 title = {エネルギー計算量に制限のある論理回路の出力パターン数の上界},
 year = {2024}
}