A Theory of Completely Monotonic Functions and its Applications to Threshold Logic

DOI10.1109/TC.1968.229094zbMath0172.30301OpenAlexW2079102875MaRDI QIDQ5560295

Toshihide Ibaraki, Shuzo Yajima

Publication date: 1968

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1968.229094

zbMATH Keywords

languages, automata, networks

Related Items (2)

Boolean minors ⋮ The fixing groups for the 2-asummable Boolean functions

This page was built for publication: A Theory of Completely Monotonic Functions and its Applications to Threshold Logic