16666 search results - page 260 / 3334 » Descriptive and Computational Complexity |
162
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they hav...
132
click to vote
MFCS
1990
Springer
15 years 10 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
135
click to vote
EH
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents a detailed technical description of a large-scale evolvable hardware system for evolving complex digital circuits directly in silicon at high speed. The core o...
182
click to vote
BC
2000
15 years 6 months ago
2000
We identify generic sources of complex and irregular spiking in biological neural networks. For the network description, we operate on a mathematically exact mesoscopic approach. S...