On the complexity of encoding in analog circuits

被引：1
|
作者：
Wegener, I
机构：
[1] FB Informatik, LS II, Universität Dortmund
来源：
INFORMATION PROCESSING LETTERS | 1996年 / 60卷 / 01期
关键词：
computational complexity; analog circuits; Boolean functions;
D O I：
10.1016/S0020-0190(96)00137-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Fan-in 2 analog circuits over the basis {+, -, *, /} are investigated. The problem of encoding a Boolean vector is the problem of computing a one-to-one mapping f : {0, 1}(n) --> R. It is proved that the optimal encoding formula has size [(3n - 1)/2] and that encoding circuits have at least 5n/4 - 0(1) gates.
引用
收藏
页码：49 / 52
页数：4
相关论文
共 50 条
12345